Sciweavers

1261 search results - page 139 / 253
» Approximation algorithms for aligning points
Sort
View
ICMLA
2009
14 years 7 months ago
Structured Prediction with Relative Margin
In structured prediction problems, outputs are not confined to binary labels; they are often complex objects such as sequences, trees, or alignments. Support Vector Machine (SVM) ...
Pannagadatta K. Shivaswamy, Tony Jebara
COMPGEOM
2009
ACM
15 years 4 months ago
PTAS for geometric hitting set problems via local search
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...
Nabil H. Mustafa, Saurabh Ray
VISUALIZATION
1997
IEEE
15 years 2 months ago
Fast oriented line integral convolution for vector field visualization via the Internet
Oriented Line Integral Convolution (OLIC) illustrates flow fields by convolving a sparse texture with an anisotropic convolution kernel. The kernel is aligned to the underlying ...
Rainer Wegenkittl, Eduard Gröller
CVGIP
2007
136views more  CVGIP 2007»
14 years 10 months ago
Contour-based surface reconstruction using MPU implicit models
This paper presents a technique for creating a smooth, closed surface from a set of 2D contours, which have been extracted from a 3D scan. The technique interprets the pixels that...
Ilya Braude, Jeffrey Marker, Ken Museth, Jonathan ...
STACS
2005
Springer
15 years 3 months ago
Algorithmics in Exponential Time
Exponential algorithms, i.e. algorithms of complexity O(cn ) for some c > 1, seem to be unavoidable in the case of NP-complete problems (unless P=NP), especially if the problem ...
Uwe Schöning