5153 search results - page 828 / 1031 » Introduction to Randomized Algorithms |
170
Voted
ECCV
2004
Springer
16 years 5 months ago
2004
Springer
The problem of interactive foreground/background segmentation in still images is of great practical importance in image editing. The state of the art in interactive segmentation is...
126
click to vote
WWW
2007
ACM
16 years 4 months ago
2007
ACM
A minimal perfect function maps a static set of keys on to the range of integers {0,1,2, ... , - 1}. We present a scalable high performance algorithm based on random graphs for ...
141
Voted
ICALP
2009
Springer
16 years 3 months ago
2009
Springer
Traditionally, combinatorial optimization problems (such as maximum flow, maximum matching, etc.) have been studied for networks where each link has a fixed capacity. Recent resear...
254
click to vote
VLDB
2007
ACM
16 years 3 months ago
2007
ACM
Whenever an intrusion occurs, the security and value of a computer system is compromised. Network-based attacks make it difficult for legitimate users to access various network ser...
164
click to vote
EDBT
2004
ACM
16 years 3 months ago
2004
ACM
There is a growing interest in on-line algorithms for analyzing and querying data streams, that examine each stream element only once and have at their disposal, only a limited amo...