2168 search results - page 378 / 434 » Randomized Algorithms and Complexity Theory |
163
click to vote
WISEC
2010
ACM
15 years 7 months ago
2010
ACM
Key management in wireless sensor networks does not only face typical, but also several new challenges. The scale, resource limitations, and new threats such as node capture and c...
162
Voted
ECCV
2004
Springer
16 years 4 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...
124
click to vote
DAGM
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. Approaches to visual navigation, e.g. used in robotics, require computationally efficient, numerically stable, and robust methods for the estimation of ego-motion. One of...
128
Voted
CVPR
2007
IEEE
16 years 4 months ago
2007
IEEE
The state-of-the-art object detection algorithm learns a binary classifier to differentiate the foreground object from the background. Since the detection algorithm exhaustively s...
148
click to vote
STOC
2009
ACM
16 years 3 months ago
2009
ACM
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hy...