3894 search results - page 443 / 779 » Approximation Algorithms for Biclustering Problems |
139
click to vote
JAIR
2010
15 years 3 months ago
2010
Domain-specific features are important in representing problem structure throughout machine learning and decision-theoretic planning. In planning, once state features are provide...
174
click to vote
CVPR
2011
IEEE
15 years 25 days ago
2011
IEEE
Nearly every structured prediction problem in computer vision requires approximate inference due to large and complex dependencies among output labels. While graphical models prov...
138
click to vote
ECCV
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. Many computer vision problems such as object segmentation or reconstruction can be formulated in terms of labeling a set of pixels or voxels. In certain scenarios, we may...
142
click to vote
CORR
2002
Springer
15 years 4 months ago
2002
Springer
Global mobile robot localization is the problem of determining a robot's pose in an environment, using sensor data, when the starting position is unknown. A family of probabi...
142
Voted
3DIM
2007
IEEE
15 years 8 months ago
2007
IEEE
An algorithm is presented to estimate the position of a hand-held camera with respect to a 3d world model constructed from range data and color imagery. Little prior knowledge is ...