724 search results - page 73 / 145 » Practical Performance of Efficient Minimum Cut Algorithms |
120
click to vote
BMCBI
2002
14 years 11 months ago
2002
Background: Recently, Almeida and Vinga offered a new approach for the representation of arbitrary discrete sequences, referred to as Universal Sequence Maps (USM), and discussed ...
ADHOC
2010
14 years 12 months ago
2010
We investigate the problem of sleep/wake scheduling for low duty cycle sensor networks. Our work differs from prior work in that we explicitly consider the effect of synchronizati...
120
click to vote
CVPR
2005
IEEE
16 years 1 months ago
2005
IEEE
The mean shift algorithm has achieved considerable success in object tracking due to its simplicity and robustness. It finds local minima of a similarity measure between the color...
PPOPP
2009
ACM
16 years 11 days ago
2009
ACM
Fairness is an essential requirement of any operating system scheduler. Unfortunately, existing fair scheduling algorithms are either inaccurate or inefficient and non-scalable fo...
141
click to vote
CPM
1998
Springer
15 years 4 months ago
1998
Springer
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...