3341 search results - page 142 / 669 » On Bounded Queries and Approximation |
76
Voted
COMPGEOM
2008
ACM
14 years 12 months ago
2008
ACM
The Johnson-Lindenstrauss random projection lemma gives a simple way to reduce the dimensionality of a set of points while approximately preserving their pairwise distances. The m...
81
Voted
SIGDIAL
2010
14 years 4 months ago
2010
We perform a study of existing dialogue corpora to establish the theoretical maximum performance of the selection approach to simulating human dialogue behavior in unseen dialogue...
68
Voted
COCOON
2005
Springer
15 years 3 months ago
2005
Springer
Rocchio’s similarity-based relevance feedback algorithm, one of the most important query reformation methods in information retrieval, is essentially an adaptive supervised lear...
TOC
2008
14 years 10 months ago
2008
Abstract: Schnorr's algorithm for finding an approximation for the shortest nonzero vector in an n-dimensional lattice depends on a parameter k. He proved that for a fixed k ...
UAI
2008
14 years 11 months ago
2008
This paper develops a measure for bounding the performance of AND/OR search algorithms for solving a variety of queries over graphical models. We show how drawing a connection to ...