Sciweavers

7913 search results - page 247 / 1583
» Information Collection on a Graph
Sort
View
CVPR
2012
IEEE
13 years 3 months ago
Segmentation using superpixels: A bipartite graph partitioning approach
Grouping cues can affect the performance of segmentation greatly. In this paper, we show that superpixels (image segments) can provide powerful grouping cues to guide segmentation...
Zhenguo Li, Xiao-Ming Wu, Shih-Fu Chang
92
Voted
GBRPR
2009
Springer
15 years 7 months ago
On Computing Canonical Subsets of Graph-Based Behavioral Representations
The collection of behavior protocols is a common practice in human factors research, but the analysis of these large data sets has always been a tedious and time-consuming process....
Walter C. Mankowski, Peter Bogunovich, Ali Shokouf...
ISAAC
2005
Springer
106views Algorithms» more  ISAAC 2005»
15 years 6 months ago
Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs
Let G = (V, E) be an undirected graph, and let B ⊆ V × V be a collection of vertex pairs. We give an incremental polynomial time algorithm to enumerate all minimal edge sets X â...
Leonid Khachiyan, Endre Boros, Konrad Borys, Khale...
117
Voted
CVPR
2008
IEEE
16 years 2 months ago
Skeletal graphs for efficient structure from motion
We address the problem of efficient structure from motion for large, unordered, highly redundant, and irregularly sampled photo collections, such as those found on Internet photo-...
Noah Snavely, Steven M. Seitz, Richard Szeliski
STOC
2004
ACM
110views Algorithms» more  STOC 2004»
16 years 29 days ago
On sums of independent random variables with unbounded variance, and estimating the average degree in a graph
We prove the following inequality: for every positive integer n and every collection X1, . . . , Xn of nonnegative independent random variables that each has expectation 1, the pr...
Uriel Feige