1261 search results - page 139 / 253 » Approximation algorithms for aligning points |
129
click to vote
ICMLA
2009
15 years 16 days ago
2009
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) ...
110
click to vote
COMPGEOM
2009
ACM
15 years 9 months ago
2009
ACM
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...
126
click to vote
VISUALIZATION
1997
IEEE
15 years 7 months ago
1997
IEEE
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 ...
119
click to vote
CVGIP
2007
15 years 2 months ago
2007
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...
134
click to vote
STACS
2005
Springer
15 years 8 months ago
2005
Springer
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 ...