139 search results - page 24 / 28 » Structured low-rank approximation and its applications |
TKDE
2010
14 years 8 months ago
2010
—A Bloom filter is an effective, space-efficient data structure for concisely representing a set, and supporting approximate membership queries. Traditionally, the Bloom filter a...
112
click to vote
COMPGEOM
2004
ACM
15 years 1 months ago
2004
ACM
We introduce a new approach to the problem of collision detection between a rotating milling-cutter of an NC-machine and a model of a solid workpiece, as the rotating cutter conti...
78
Voted
BMCBI
2010
14 years 9 months ago
2010
Background: Existing hidden Markov model decoding algorithms do not focus on approximately identifying the sequence feature boundaries. Results: We give a set of algorithms to com...
171
click to vote
VLDB
2007
ACM
15 years 9 months ago
2007
ACM
Given a set of model graphs D and a query graph q, containment search aims to find all model graphs g D such that q contains g (q g). Due to the wide adoption of graph models, f...
174
click to vote
SIGMOD
2009
ACM
15 years 9 months ago
2009
ACM
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational data...