Sciweavers

396 search results - page 74 / 80
» A Graph Cut Algorithm for Generalized Image Deconvolution
Sort
View
JMLR
2010
144views more  JMLR 2010»
13 years 3 months ago
Maximum Margin Learning with Incomplete Data: Learning Networks instead of Tables
In this paper we address the problem of predicting when the available data is incomplete. We show that changing the generally accepted table-wise view of the sample items into a g...
Sándor Szedmák, Yizhao Ni, Steve R. ...
COMPGEOM
2006
ACM
14 years 2 months ago
Colored intersection searching via sparse rectangular matrix multiplication
In a Batched Colored Intersection Searching Problem (CI), one is given a set of n geometric objects (of a certain class). Each object is colored by one of c colors, and the goal i...
Haim Kaplan, Micha Sharir, Elad Verbin
CVPR
2011
IEEE
13 years 4 months ago
Hyper-graph Matching via Reweighted Random Walks
Establishing correspondences between two feature sets is a fundamental issue in computer vision, pattern recognition, and machine learning. This problem can be well formulated as g...
Jungmin Lee (Seoul National University), Minsu Cho...
IROS
2007
IEEE
127views Robotics» more  IROS 2007»
14 years 2 months ago
Goal directed navigation with uncertainty in adversary locations
— This paper addresses the problem of planning for goal directed navigation in the environment that contains a number of possible adversary locations. It first shows that common...
Maxim Likhachev, Anthony Stentz
3DIM
2007
IEEE
14 years 2 months ago
Surface Reconstruction from Point Clouds by Transforming the Medial Scaffold
We propose an algorithm for surface reconstruction from unorganized points based on a view of the sampling process as a deformation from the original surface. In the course of thi...
Ming-Ching Chang, Frederic F. Leymarie, Benjamin B...