1092 search results - page 165 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
162
click to vote
TAMC
2007
Springer
16 years 11 days ago
2007
Springer
Abstract. Kernelizations are an important tool in designing fixed parameter algorithms for parameterized decision problems. We introduce an analogous notion for counting problems,...
214
click to vote
DAC
2003
ACM
16 years 7 months ago
2003
ACM
To save energy, many power management policies rely on issuing mode-change commands to the components of the system. Efforts to date have focused on how these policies interact wi...
192
click to vote
RECOMB
2006
Springer
16 years 6 months ago
2006
Springer
Abstract. Preliminary to most comparative genomics studies is the annotation of chromosomes as ordered sequences of genes. Unfortunately, different genetic mapping techniques usual...
157
click to vote
IROS
2009
IEEE
16 years 28 days ago
2009
IEEE
— This paper describes an algorithm for estimating lane boundaries and curbs from a moving vehicle using noisy observations and a probabilistic model of curvature. The primary co...
211
click to vote
SMA
2009
ACM
16 years 23 days ago
2009
ACM
We examine the problem of computing exactly the Delaunay graph (and the dual Voronoi diagram) of a set of, possibly intersecting, smooth convex pseudo-circles in the Euclidean pla...