4860 search results - page 532 / 972 » SNPs Problems, Complexity, and Algorithms |
152
click to vote
STOC
1996
ACM
15 years 8 months ago
1996
ACM
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
152
click to vote
ALGORITHMICA
2000
15 years 4 months ago
2000
We study the problem of minimizing the expected cost of binary searching for data where the access cost is not fixed and depends on the last accessed element, such as data stored i...
175
Voted
SIGIR
2012
ACM
13 years 7 months ago
2012
ACM
Enterprise search is challenging for several reasons, notably the dynamic terminology and jargon that are specific to the enterprise domain. This challenge is partly addressed by...
138
click to vote
ECCV
2004
Springer
16 years 6 months ago
2004
Springer
Level-set methods have been shown to be an effective way to solve optimisation problems that involve closed curves. They are well known for their capacity to deal with flexible top...
140
click to vote
IPSN
2009
Springer
15 years 11 months ago
2009
Springer
In this work we present new in-network techniques for communication efficient approximate query processing in wireless sensornets. We use a model-based approach that constructs a...