10412 search results - page 1895 / 2083 » The efficiency of algorithms - misconceptions |
147
click to vote
STOC
2001
ACM
16 years 4 months ago
2001
ACM
The dynamic behavior of a network in which information is changing continuously over time requires robust and efficient mechanisms for keeping nodes updated about new information. ...
220
click to vote
VLDB
2004
ACM
16 years 4 months ago
2004
ACM
Ranking queries produce results that are ordered on some computed score. Typically, these queries involve joins, where users are usually interested only in the top-k join results....
224
click to vote
VLDB
2008
ACM
16 years 4 months ago
2008
ACM
Several variations of nearest neighbor (NN) query have been investigated by the database community. However, realworld applications often result in the formulation of new variatio...
213
click to vote
SIGMOD
2009
ACM
16 years 4 months ago
2009
ACM
Uncertain data arises in a number of domains, including data integration and sensor networks. Top-k queries that rank results according to some user-defined score are an important...
242
click to vote
SIGMOD
2009
ACM
16 years 4 months ago
2009
ACM
Ranking queries are essential tools to process large amounts of probabilistic data that encode exponentially many possible deterministic instances. In many applications where unce...