Sciweavers

13987 search results - page 460 / 2798
» The Two Guards Problem
Sort
View
COCOA
2011
Springer
14 years 6 months ago
The Complexity of Testing Monomials in Multivariate Polynomials
The work in this paper is to initiate a theory of testing monomials in multivariate polynomials. The central question is to ask whether a polynomial represented by certain economi...
Zhixiang Chen, Bin Fu
CVPR
2008
IEEE
1042views Computer Vision» more  CVPR 2008»
16 years 9 months ago
Graph cut based image segmentation with connectivity priors
Graph cut is a popular technique for interactive image segmentation. However, it has certain shortcomings. In particular, graph cut has problems with segmenting thin elongated obj...
Sara Vicente, Vladimir Kolmogorov, Carsten Rother
ICCV
2003
IEEE
16 years 9 months ago
Learning How to Inpaint from Global Image Statistics
Inpainting is the problem of filling-in holes in images. Considerable progress has been made by techniques that use the immediate boundary of the hole and some prior information o...
Anat Levin, Assaf Zomet, Yair Weiss
ICIP
2000
IEEE
16 years 8 months ago
Efficiently Estimating Projective Transformations
Projective transformations relate the coordinates of images that are taken by either a camera that undergoes only rotation while imaging an arbitrary scene, or one that rotates an...
Richard J. Radke, Peter J. Ramadge, Tomio Echigo, ...
175
Voted
ICML
1996
IEEE
16 years 7 months ago
On the Learnability of the Uncomputable
Within Valiant'smodel of learning as formalized by Kearns, we show that computable total predicates for two formallyuncomputable problems the classical Halting Problem, and t...
Richard H. Lathrop