7150 search results - page 26 / 1430 » An Approximation Algorithm for Approximation Rank |
122
click to vote
VLDB
2011
ACM
14 years 7 months ago
2011
ACM
Uncertain data is inherent in a few important applications such as environmental surveillance and mobile object tracking. Top-k queries (also known as ranking queries) are often n...
132
Voted
KDD
2008
ACM
16 years 26 days ago
2008
ACM
: Locality Sensitive Hash functions are invaluable tools for approximate near neighbor problems in high dimensional spaces. In this work, we are focused on LSH schemes where the si...
115
click to vote
SIGECOM
2010
ACM
15 years 5 months ago
2010
ACM
One of the fundamental problems in the theory of social choice is aggregating the rankings of a set of agents (or voters) into a consensus ranking. Rank aggregation has found appl...
95
Voted
FCT
2005
Springer
15 years 6 months ago
2005
Springer
Block sorting is used in connection with optical character recognition (OCR). Recent work has focused on finding good strategies which perform well in practice. Block sorting is N...
77
Voted
TRS
2008
15 years 10 days ago
2008
Abstract. For completely specified decision tables lower and upper approximations are unique, the lower approximation is the largest definable set contained in the approximated set...