3894 search results - page 611 / 779 » Approximation Algorithms for Biclustering Problems |
151
click to vote
VLDB
2011
ACM
14 years 10 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...
131
Voted
EDBT
2004
ACM
16 years 3 months ago
2004
ACM
Abstract. Recent years have witnessed an increasing interest in designing algorithms for querying and analyzing streaming data (i.e., data that is seen only once in a fixed order) ...
143
Voted
ICALP
2004
Springer
15 years 9 months ago
2004
Springer
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
122
click to vote
INFOCOM
2010
IEEE
15 years 2 months ago
2010
IEEE
Abstract—When forwarding packets in the Internet, Autonomous Systems (ASes) frequently choose the shortest path in their network to the next-hop AS in the BGP path, a strategy kn...
129
Voted
STOC
2007
ACM
16 years 3 months ago
2007
ACM
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...