Sciweavers

5580 search results - page 1016 / 1116
» Randomized priority algorithms
Sort
View
STOC
2010
ACM
200views Algorithms» more  STOC 2010»
14 years 5 months ago
Hardness Amplification in Proof Complexity
We present a generic method for converting any family of unsatisfiable CNF formulas that require large resolution rank into CNF formulas whose refutation requires large rank for p...
Paul Beame, Trinh Huynh and Toniann Pitassi
ISCA
2005
IEEE
101views Hardware» more  ISCA 2005»
14 years 1 months ago
Near-Optimal Worst-Case Throughput Routing for Two-Dimensional Mesh Networks
Minimizing latency and maximizing throughput are important goals in the design of routing algorithms for interconnection networks. Ideally, we would like a routing algorithm to (a...
Daeho Seo, Akif Ali, Won-Taek Lim, Nauman Rafique,...
CVPR
2004
IEEE
14 years 10 months ago
Model-Based Motion Clustering Using Boosted Mixture Modeling
Model-based clustering of motion trajectories can be posed as the problem of learning an underlying mixture density function whose components correspond to motion classes with dif...
Vladimir Pavlovic
CVPR
2008
IEEE
14 years 10 months ago
Principled fusion of high-level model and low-level cues for motion segmentation
High-level generative models provide elegant descriptions of videos and are commonly used as the inference framework in many unsupervised motion segmentation schemes. However, app...
Arasanathan Thayananthan, Masahiro Iwasaki, Robert...
IPMI
2003
Springer
14 years 8 months ago
Expectation Maximization Strategies for Multi-atlas Multi-label Segmentation
It is well-known in the pattern recognition community that the accuracy of classifications obtained by combining decisions made by independent classifiers can be substantially high...
Torsten Rohlfing, Daniel B. Russakoff, Calvin R. M...
« Prev « First page 1016 / 1116 Last » Next »