526 search results - page 37 / 106 » Increments of Random Partitions |
114
Voted
TSP
2010
14 years 9 months ago
2010
Abstract--In this paper, we consider a competitive approach to sequential decision problems, suitable for a variety of signal processing applications where at each of a succession ...
117
click to vote
CVPR
2010
IEEE
15 years 10 months ago
2010
IEEE
Conditional Random Field models have proved effective for several low-level computer vision problems. Inference in these models involves solving a combinatorial optimization probl...
163
Voted
ICDM
2006
IEEE
15 years 8 months ago
2006
IEEE
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...
133
Voted
MFCS
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
92
Voted
WSC
1997
15 years 4 months ago
1997
In recent articles we presented a general methodology for finite optimization. The new method, the Nested Partitions (NP) method, combines partitioning, random sampling, a select...