Sciweavers

2310 search results - page 153 / 462
» Coloring Random Graphs
Sort
View
121
Voted
ICML
2004
IEEE
16 years 3 months ago
Semi-supervised learning using randomized mincuts
In many application domains there is a large amount of unlabeled data but only a very limited amount of labeled training data. One general approach that has been explored for util...
Avrim Blum, John D. Lafferty, Mugizi Robert Rweban...
123
Voted
APPROX
2009
Springer
153views Algorithms» more  APPROX 2009»
15 years 9 months ago
Average-Case Analyses of Vickrey Costs
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...
Prasad Chebolu, Alan M. Frieze, Páll Melste...
138
Voted
CPAIOR
2008
Springer
15 years 4 months ago
Using Local Search to Speed Up Filtering Algorithms for Some NP-Hard Constraints
Abstract. This paper proposes to use local search inside filtering algorithms of combinatorial structures for which achieving a desired level of consistency is too computationally ...
Philippe Galinier, Alain Hertz, Sandrine Paroz, Gi...
ISCAS
2006
IEEE
116views Hardware» more  ISCAS 2006»
15 years 8 months ago
Wavelet based detection of moving tree branches and leaves in video
—A method for detection of tree branches and leaves in video is proposed. It is observed that the motion vectors of tree branches and leaves exhibit random motion. On the other h...
B. Ugur Töreyin, A. Enis Çetin