5105 search results - page 189 / 1021 » An algorithm to determine peer-reviewers |
184
click to vote
IPL
2007
15 years 6 months ago
2007
We present a simple and fast deterministic solution to the string matching with don’t cares problem. The task is to determine all positions in a text where a pattern occurs, all...
149
click to vote
ICPR
2004
IEEE
16 years 7 months ago
2004
IEEE
Object tracking algorithms extensively found in literature are either constrained with assumptions or are overly sensitive to noise. We propose and successfully test two new weigh...
158
click to vote
STOC
2007
ACM
16 years 6 months ago
2007
ACM
In the all-pairs bottleneck paths (APBP) problem (a.k.a. allpairs maximum capacity paths), one is given a directed graph with real non-negative capacities on its edges and is aske...
148
click to vote
IWOCA
2009
Springer
16 years 1 months ago
2009
Springer
d abstract) Thomas Feierl⋆ Fakult¨at f¨ur Mathematik Universit¨at Wien Nordbergstr. 15 1090 Wien, Austria Abstract. We determine the weak limit of the distribution of the rand...
133
click to vote
SIGMETRICS
2006
ACM
16 years 15 days ago
2006
ACM
Abstract— We consider a wireless system with multiple channels where each channel is either on or off, and probing the state of any channel incurs a cost. We present a polynomial...