Sciweavers

3270 search results - page 77 / 654
» Approximate String Processing
Sort
View
ICDE
2008
IEEE
166views Database» more  ICDE 2008»
14 years 9 months ago
A Clustered Index Approach to Distributed XPath Processing
Supporting top-k queries over distributed collections of schemaless XML data poses two challenges. While XML supports expressive query languages such as XPath and XQuery, these la...
Georgia Koloniari, Evaggelia Pitoura
JMLR
2002
115views more  JMLR 2002»
13 years 7 months ago
PAC-Bayesian Generalisation Error Bounds for Gaussian Process Classification
Approximate Bayesian Gaussian process (GP) classification techniques are powerful nonparametric learning methods, similar in appearance and performance to support vector machines....
Matthias Seeger
CPM
2007
Springer
94views Combinatorics» more  CPM 2007»
14 years 1 months ago
Finding Witnesses by Peeling
In the k-matches problem, we are given a pattern and a text, and for each text location, the desired output consists of all aligned matching characters if there are k or fewer of ...
Yonatan Aumann, Moshe Lewenstein, Noa Lewenstein, ...
LACL
2005
Springer
14 years 1 months ago
Strict Deterministic Aspects of Minimalist Grammars
The Minimalist Grammars (MGs) proposed by Stabler(1997) have tree-shaped derivations (Harkema, 2001b; Michaelis, 2001a). As in categorial grammars, each lexical item is an associat...
John T. Hale, Edward P. Stabler
ICDAR
2003
IEEE
14 years 1 months ago
Indexing and retrieval of words in old documents
This paper describes a system for efficient indexing and retrieval of words in collections of document images. The proposed method is based on two main principles: unsupervised pr...
Simone Marinai, Emanuele Marino, Giovanni Soda