Sciweavers

3575 search results - page 277 / 715
» Structured motifs search
Sort
View
CPAIOR
2008
Springer
15 years 8 months ago
Leveraging Belief Propagation, Backtrack Search, and Statistics for Model Counting
We consider the problem of estimating the model count (number of solutions) of Boolean formulas, and present two techniques that compute estimates of these counts, as well as eith...
Lukas Kroc, Ashish Sabharwal, Bart Selman
SODA
2000
ACM
132views Algorithms» more  SODA 2000»
15 years 8 months ago
Expected-case complexity of approximate nearest neighbor searching
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
Sunil Arya, Ho-Yam Addy Fu
JIIS
2002
141views more  JIIS 2002»
15 years 6 months ago
Combining Approximation Techniques and Vector Quantization for Adaptable Similarity Search
Adaptable similarity queries based on quadratic form distance functions are widely popular in data mining application domains including multimedia, CAD, molecular biology or medica...
Christian Böhm, Hans-Peter Kriegel, Thomas Se...
COMGEO
2004
ACM
15 years 6 months ago
Expected time analysis for Delaunay point location
We consider point location in Delaunay triangulations with the aid of simple data structures. In particular, we analyze methods in which a simple data structure is used to first lo...
Luc Devroye, Christophe Lemaire, Jean-Michel Morea...
ICDT
2009
ACM
130views Database» more  ICDT 2009»
16 years 7 months ago
Towards a theory of search queries
The need to manage diverse information sources has triggered the rise of very loosely structured data models, known as "dataspace models." Such information management sy...
George H. L. Fletcher, Jan Van den Bussche, Dirk V...