Sciweavers

1093 search results - page 116 / 219
» Clustering from Constraint Graphs
Sort
View
CVPR
2000
IEEE
16 years 5 months ago
Image Segmentation by Nested Cuts
We present a new image segmentation algorithm based on graph cuts. Our main tool is separation of each pixel from a special point outside the image by a cut of a minimum cost. Suc...
Olga Veksler
127
Voted
ICS
2010
Tsinghua U.
16 years 29 days ago
Local Algorithms for Finding Interesting Individuals in Large Networks
: We initiate the study of local, sublinear time algorithms for finding vertices with extreme topological properties -- such as high degree or clustering coefficient -- in large so...
Mickey Brautbar, Michael Kearns
144
Voted
CVPR
2010
IEEE
15 years 11 months ago
Collect-Cut: Segmentation with Top-Down Cues Discovered in Multi-Object Images
We present a method to segment a collection of unlabeled images while exploiting automatically discovered appearance patterns shared between them. Given an unlabeled pool of multi...
Yong Jae Lee, Kristen Grauman
113
Voted
VLDB
1995
ACM
87views Database» more  VLDB 1995»
15 years 7 months ago
Redo Recovery after System Crashes
: This paper defines a framework for explaining redo recovery after a system crash. In this framework, an installation graph explains the order in which operations must be install...
David B. Lomet, Mark R. Tuttle
136
Voted
EMMCVPR
2007
Springer
15 years 9 months ago
Simulating Classic Mosaics with Graph Cuts
Classic mosaic is one of the oldest and most durable art forms. There has been a growing interest in simulating classic mosaics from digital images recently. To be visually pleasin...
Yu Liu, Olga Veksler, Olivier Juan