4066 search results - page 276 / 814 » Almost Complete Sets |
200
Voted
STOC
2010
ACM
15 years 11 months ago
2010
ACM
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
176
click to vote
ESSLLI
1999
Springer
15 years 11 months ago
1999
Springer
This paper presents a grammar formalism in which constituent graphs are unions of a continuous surface tree and a discontinuous deep tree. The formalism has an object-oriented desi...
190
click to vote
VISUALIZATION
1999
IEEE
15 years 11 months ago
1999
IEEE
In recent years, substantial progress has been achieved in the area of volume visualization on irregular grids, which is mainly based on tetrahedral meshes. Even moderately fine t...
169
click to vote
FCCM
1998
IEEE
15 years 11 months ago
1998
IEEE
One of the major overheads in reconfigurable computing is the time it takes to reconfigure the devices in the system. This overhead limits the speedups possible in this exciting n...
161
click to vote
ICMCS
1997
IEEE
15 years 11 months ago
1997
IEEE
Near-Video-on-Demand (NVOD) provides customers with a service model completely different from true Video-on-Demand (VOD). In the NVOD service model, customers’ requests are not ...