2310 search results - page 168 / 462 » Coloring Random Graphs |
128
Voted
SODA
1993
ACM
15 years 3 months ago
1993
ACM
The following bounds on the competitive ratios of deterministic and randomized on-line algorithms for traversing width-w layered graphs are obtained.
113
click to vote
ACL
2009
15 years 10 days ago
2009
Most approaches to topic modeling assume an independence between documents that is frequently violated. We present an topic model that makes use of one or more user-specified grap...
108
Voted
CVPR
2007
IEEE
16 years 4 months ago
2007
IEEE
State-of-the-art stereo vision algorithms utilize color changes as important cues for object boundaries. Most methods impose heuristic restrictions or priors on disparities, for e...
115
click to vote
ISAAC
1997
Springer
15 years 6 months ago
1997
Springer
We present a randomized EREW PRAM algorithm to nd a minimum spanning forest in a weighted undirected graph. On an n-vertex graph the algorithm runs in o((logn)1+ ) expected time f...
146
click to vote
ICASSP
2010
IEEE
15 years 2 months ago
2010
IEEE
We propose an algorithm for detecting bridges and estimating geodesic distances from a set of noisy samples of an underlying manifold. Finding geodesics on a nearest neighbors gra...