Sciweavers

2526 search results - page 49 / 506
» A New Algorithm for Answer Set Computation
Sort
View
ICCV
2003
IEEE
14 years 11 months ago
A New Perspective [on] Shape-from-Shading
Shape-from-Shading (SfS) is a fundamental problem in Computer Vision. The vast majority of research in this field have assumed orthography as its projection model. This paper re-e...
Ariel Tankus, Nir A. Sochen, Yehezkel Yeshurun
FOCS
1999
IEEE
14 years 1 months ago
Boosting and Hard-Core Sets
This paper connects two fundamental ideas from theoretical computer science: hard-core set construction, a type of hardness amplification from computational complexity, and boosti...
Adam Klivans, Rocco A. Servedio
STOC
2010
ACM
245views Algorithms» more  STOC 2010»
14 years 2 months ago
Weighted Geometric Set Cover via Quasi-Uniform Sampling
There has been much progress on geometric set cover problems, but most known techniques only apply to the unweighted setting. For the weighted setting, very few results are known ...
Kasturi Varadarajan
CGF
2008
227views more  CGF 2008»
13 years 9 months ago
Dynamic Sampling and Rendering of Algebraic Point Set Surfaces
Algebraic Point Set Surfaces (APSS) define a smooth surface from a set of points using local moving least-squares (MLS) fitting of algebraic spheres. In this paper we first revisi...
Gaël Guennebaud, Marcel Germann, Markus H. Gr...
DIS
2006
Springer
14 years 28 days ago
A New Family of String Classifiers Based on Local Relatedness
This paper introduces a new family of string classifiers based on local relatedness. We use three types of local relatedness measurements, namely, longest common substrings (LCStr&...
Yasuto Higa, Shunsuke Inenaga, Hideo Bannai, Masay...