Sciweavers

835 search results - page 150 / 167
» Finding Optimal Solutions to Cooperative Pathfinding Problem...
Sort
View
ICML
2010
IEEE
13 years 8 months ago
Boosting Classifiers with Tightened L0-Relaxation Penalties
We propose a novel boosting algorithm which improves on current algorithms for weighted voting classification by striking a better balance between classification accuracy and the ...
Noam Goldberg, Jonathan Eckstein
TIP
2010
129views more  TIP 2010»
13 years 2 months ago
Image Segmentation by MAP-ML Estimations
Abstract--Image segmentation plays an important role in computer vision and image analysis. In this paper, image segmentation is formulated as a labeling problem under a probabilit...
Shifeng Chen, Liangliang Cao, Yueming Wang, Jianzh...
TIT
2010
130views Education» more  TIT 2010»
13 years 2 months ago
The power of convex relaxation: near-optimal matrix completion
This paper is concerned with the problem of recovering an unknown matrix from a small fraction of its entries. This is known as the matrix completion problem, and comes up in a gr...
Emmanuel J. Candès, Terence Tao
CVPR
2008
IEEE
14 years 9 months ago
Exact inference in multi-label CRFs with higher order cliques
This paper addresses the problem of exactly inferring the maximum a posteriori solutions of discrete multi-label MRFs or CRFs with higher order cliques. We present a framework to ...
Srikumar Ramalingam, Pushmeet Kohli, Karteek Alaha...
HPDC
2005
IEEE
14 years 1 months ago
Genetic algorithm based automatic data partitioning scheme for HPF
good data partitioning scheme is the need of the time. However it is very diflcult to arrive at a good solution as the number of possible dutupartitionsfor a given real lifeprogra...
Sunil Kumar Anand, Y. N. Srikant