264 search results - page 28 / 53 » On the possibility of faster SAT algorithms |
100
click to vote
ICIP
2007
IEEE
15 years 11 months ago
2007
IEEE
In this paper we propose a new approach of the two-image alignment problem based on a functional representation of images. This allows us to derive a one-to-several correspondence,...
102
click to vote
UAI
2008
14 years 11 months ago
2008
An efficient policy search algorithm should estimate the local gradient of the objective function, with respect to the policy parameters, from as few trials as possible. Whereas m...
100
click to vote
GRAPHICSINTERFACE
2001
14 years 11 months ago
2001
We introduce a new acceleration to the standard splatting volume rendering algorithm. Our method achieves full colour (32-bit), depth-sorted and shaded volume rendering significan...
115
click to vote
TCS
2010
14 years 8 months ago
2010
We consider a graph-theoretical formalization of the process of gene assembly in ciliates introduced in Ehrenfeucht et al (2003), where a gene is modeled as a signed graph. The ge...
94
Voted
ISMIR
2005
Springer
15 years 3 months ago
2005
Springer
We describe a recursive algorithm to quickly compute the N nearest neighbors according to a similarity measure in a metric space. The algorithm exploits an intrinsic property of a...