2310 search results - page 155 / 462 » Coloring Random Graphs |
152
Voted
NIPS
2004
15 years 4 months ago
2004
We seek to both detect and segment objects in images. To exploit both local image data as well as contextual information, we introduce Boosted Random Fields (BRFs), which use boos...
104
Voted
ICML
2006
IEEE
16 years 3 months ago
2006
IEEE
In this paper, we use large neighborhood Markov random fields to learn rich prior models of color images. Our approach extends the monochromatic Fields of Experts model (Roth &...
95
Voted
IBPRIA
2005
Springer
15 years 8 months ago
2005
Springer
In this paper we approach the problem of fast surface grading of flat pieces decorated with random patterns. The proposed method is based on the use of global statistics of color ...
138
Voted
STOC
2006
ACM
16 years 2 months ago
2006
ACM
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
101
Voted
LCN
2007
IEEE
15 years 8 months ago
2007
IEEE
Abstract—We study the performance of several search algorithms on unstructured peer-to-peer networks, both using classic search algorithms such as flooding and random walk, as w...