Sciweavers

1933 search results - page 62 / 387
» Improved Algorithms for the Feedback Vertex Set Problems
Sort
View
CORR
2010
Springer
94views Education» more  CORR 2010»
13 years 7 months ago
When LP is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings
Abstract Consider a random graph model where each possible edge e is present independently with some probability pe. Given these probabilities, we want to build a large/heavy match...
Nikhil Bansal, Anupam Gupta, Jian Li, Juliá...
CVPR
2003
IEEE
14 years 10 months ago
Nearest Neighbor Search for Relevance Feedback
We introduce the problem of repetitive nearest neighbor search in relevance feedback and propose an efficient search scheme for high dimensional feature spaces. Relevance feedback...
Jelena Tesic, B. S. Manjunath
PODC
2010
ACM
14 years 20 days ago
A new technique for distributed symmetry breaking
We introduce Multi-Trials, a new technique for symmetry breaking for distributed algorithms and apply it to various problems in general graphs. For instance, we present three rand...
Johannes Schneider, Roger Wattenhofer
PPSN
1998
Springer
14 years 1 months ago
Genetic Algorithms for the Multiple Container Packing Problem
This paper presents two variants of Genetic Algorithms (GAs) for solving the Multiple Container Packing Problem (MCPP), which is a combinatorial optimization problem comprising sim...
Günther R. Raidl, Gabriele Kodydek
CIVR
2007
Springer
102views Image Analysis» more  CIVR 2007»
14 years 3 months ago
Visual information retrieval using synthesized imagery
In this project (VIRSI) we investigate the promising contentbased retrieval paradigm known as interactive search or relevance feedback, and aim to extend it through the use of syn...
Bart Thomee, Mark J. Huiskes, Erwin M. Bakker, Mic...