Sciweavers

381 search results - page 8 / 77
» Approximate Matching of Hierarchical Data Using pq-Grams
Sort
View
NIPS
2004
13 years 8 months ago
Learning Gaussian Process Kernels via Hierarchical Bayes
We present a novel method for learning with Gaussian process regression in a hierarchical Bayesian framework. In a first step, kernel matrices on a fixed set of input points are l...
Anton Schwaighofer, Volker Tresp, Kai Yu
KR
2004
Springer
14 years 2 days ago
Qualitative Probabilistic Matching with Hierarchical Descriptions
This paper is about decision making based on real-world descriptions of a domain. There are many domains where differentpeoplehavedescribedvariouspartsoftheworldatdifferent f abst...
Clinton Smyth, David Poole
FOCS
2008
IEEE
14 years 1 months ago
A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
Rina Panigrahy, Kunal Talwar, Udi Wieder
ENTCS
2008
116views more  ENTCS 2008»
13 years 6 months ago
Phil: A Lazy Implementation of a Language for Approximate Filtering of XML Documents
In this paper, we introduce a system, written in Haskell, for filtering information from XML data. Essentially, the system implements a simple declarative language which allows on...
Michele Baggi, Demis Ballis
FCCM
2011
IEEE
311views VLSI» more  FCCM 2011»
12 years 10 months ago
String Matching in Hardware Using the FM-Index
—String matching is a ubiquitous problem that arises in a wide range of applications in computing, e.g., packet routing, intrusion detection, web querying, and genome analysis. D...
Edward Fernandez, Walid Najjar, Stefano Lonardi