Sciweavers

176 search results - page 12 / 36
» A Clustering Approach to Solving Large Stochastic Matching P...
Sort
View
ECCV
2006
Springer
14 years 10 months ago
Fast Memory-Efficient Generalized Belief Propagation
Generalized Belief Propagation (gbp) has proven to be a promising technique for performing inference on Markov random fields (mrfs). However, its heavy computational cost and large...
M. Pawan Kumar, Philip H. S. Torr
SIGGRAPH
2000
ACM
14 years 4 days ago
Out-of-core simplification of large polygonal models
We present an algorithm for out-of-core simplification of large polygonal datasets that are too complex to fit in main memory. The algorithm extends the vertex clustering scheme o...
Peter Lindstrom
COR
2006
140views more  COR 2006»
13 years 8 months ago
Aggregation for the probabilistic traveling salesman problem
5 In the probabilistic traveling salesman problem (PTSP), customers require a visit with a given probability, and the best solution is the tour through all customers with the lowe...
Ann Melissa Campbell
WCE
2007
13 years 9 months ago
Scenario Generation Employing Copulas
—Multistage stochastic programs are effective for solving long-term planning problems under uncertainty. Such programs are usually based on scenario generation model about future...
Kristina Sutiene, Henrikas Pranevicius
CVPR
2011
IEEE
13 years 3 months ago
Contour-Based Joint Clustering of Multiple Segmentations
We present an unsupervised, shape-based method for joint clustering of multiple image segmentations. Given two or more closely-related images, such as nearby frames in a video sequ...
Daniel Glasner, Shiv N. Vitaladevuni and Ronen Bas...