5981 search results - page 237 / 1197 » time 2006 |
141
click to vote
COCO
2006
Springer
15 years 10 months ago
2006
Springer
We establish a close connection between (sub)exponential time complexity and parameterized complexity by proving that the so-called miniaturization mapping is a reduction preservi...
160
click to vote
CCCG
2006
15 years 8 months ago
2006
We present a polynomial time algorithm for the unit disk covering problem with an approximation factor 72, and show that this is the best possible approximation factor based on th...
157
click to vote
JGTOOLS
2006
15 years 6 months ago
2006
In this appendix, we provide some details on the data structures used to cluster the intersection segments. Although the data structures are fairly classical (a heap, a grid and a...
137
click to vote
PRL
2002
15 years 6 months ago
2002
In this paper, general guidelines and specific algorithms for code transformations between breadth-first (BF) and depth-first (DF) linear quadtrees are proposed. Each algorithm ha...
143
click to vote
MM
2006
ACM
16 years 14 days ago
2006
ACM
We describe 3WNews as a novel system for browsing news video by the people (who) and locations (where) appearing in the footage as well as the time (when) of news events. The peop...