7228 search results - page 93 / 1446 » From Algorithmic to Subjective Randomness |
160
Voted
TVCG
2011
14 years 10 months ago
2011
—This paper considers the problem of interactively finding the cutting contour to extract components from an existing mesh. First, we propose a constrained random walks algorith...
129
click to vote
ECCV
2000
Springer
16 years 5 months ago
2000
Springer
The problem of tracking pedestrians from a moving car is a challenging one. The Condensation tracking algorithm is appealing for its generality and potential for real-time implemen...
118
Voted
APPROX
2007
Springer
15 years 9 months ago
2007
Springer
Consider a scenario where one desires to simulate the execution of some graph algorithm on random input graphs of huge, perhaps even exponential size. Sampling and storing these h...
191
click to vote
RECOMB
2001
Springer
16 years 3 months ago
2001
Springer
motif discovery problem abstracts the task of discovering short, conserved sites in genomic DNA. Pevzner and Sze recently described a precise combinatorial formulation of motif di...
148
Voted
ECCV
2006
Springer
16 years 5 months ago
2006
Springer
One of the most exciting advances in early vision has been the development of efficient energy minimization algorithms. Many early vision tasks require labeling each pixel with som...