587 results on '"Oliveira, Arlindo"'
Search Results
352. Fully Dynamic Spatial Approximation Trees
353. Probabilistic Proximity Searching Algorithms Based on Compact Partitions
354. Towards a More Comprehensive Comparison of Collaborative Filtering Algorithms
355. Focussed Structured Document Retrieval
356. Java MARIAN: From an OPAC to a Modern Digital Library System
357. A Framework for Generating Attribute Extractors for Web Data Sources
358. Web Structure, Dynamics and Page Quality
359. Pattern Matching over Multi-attribute Data Streams
360. On the Size of DASG for Multiple Texts
361. Machine Learning Approach for Homepage Finding Task
362. Faster String Matching with Super-Alphabets
363. Enhancing the Set-Based Model Using Proximity Information
364. Tree Pattern Matching for Linear Static Terms
365. A Theoretical Analysis of Google’s PageRank
366. Efficient Computation of Long Similar Subsequences
367. Firing Policies for an Arabic Rule-Based Stemmer
368. Stemming Galician Texts
369. Sorting by Prefix Transpositions
370. Optimal Exact String Matching Based on Suffix Arrays
371. String Matching Problems from Bioinformatics Which Still Need Better Solutions : Extended Abstract
372. From Searching Text to Querying XML Streams
373. The DBLP Computer Science Bibliography: Evolution, Research Issues, Perspectives
374. Computation of Substring Probabilities in Stochastic Grammars
375. On the Complexity of Consistent Identification of Some Classes of Structure Languages
376. Smoothing Probabilistic Automata: An Error-Correcting Approach
377. Permutations and Control Sets for Learning Non-regular Language Families
378. Inferring Subclasses of Contextual Languages
379. Improve the Learning of Subsequential Transducers by Using Alignments and Dictionaries
380. Learning Regular Languages Using Non Deterministic Finite Automata
381. Efficient Ambiguity Detection in C-NFA : A Step Towards the Inference of Non Deterministic Automata
382. Counting Extensional Differences in BC-Learning
383. Constructive Learning of Context-Free Languages with a Subpansive Tree
384. Computational Complexity of Problems on Probabilistic Grammars and Transducers
385. A Polynomial Time Learning Algorithm of Simple Deterministic Languages via Membership Queries and a Representative Sample
386. Identification of Tree Translation Rules from Examples
387. Inference of Finite-State Transducers by Using Regular Grammars and Morphisms
388. Learning Context-Free Grammars from Partially Structured Examples
389. Probabilistic k-Testable Tree Languages
390. Combination of Estimation Algorithms and Grammatical Inference Techniques to Learn Stochastic Context-Free Grammars
391. On the Relationship between Models for Learning in Helpful Environments
392. Iterated Transductions and Efficient Learning from Positive Data: A Unifying View
393. Identification in the Limit with Probability One of Stochastic Deterministic Finite Automata
394. Synthesizing Context Free Grammars from Sample Strings Based on Inductive CYK Algorithm
395. An Inverse Limit of Context-Free Grammars – A New Approach to Identifiability in the Limit
396. The Induction of Temporal Grammatical Rules from Multivariate Time Series
397. A Comparative Study of Two Algorithms for Automata Identification
398. Non-adjacent Digrams Improve Matching of Cross-Lingual Spelling Variants
399. Multiple Instance Learning for WSI: A comparative analysis of attention-based approaches.
400. Inflammation and all-cause mortality in patients undergoing peritoneal dialysis.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.