Sciweavers

415 search results - page 51 / 83
» Optimally Reconstructing Weighted Graphs Using Queries
Sort
View
JCP
2007
118views more  JCP 2007»
13 years 9 months ago
Dynamic Nonuniform Data Approximation in Databases with Haar Wavelet
Abstract— Data synopsis is a lossy compressed representation of data stored into databases that helps the query optimizer to speed up the query process, e.g. time to retrieve the...
Su Chen, Antonio Nucci
TIP
1998
114views more  TIP 1998»
13 years 8 months ago
An optimal polygonal boundary encoding scheme in the rate distortion sense
—In this paper, we present fast and efficient methods for the lossy encoding of object boundaries that are given as eight-connect chain codes. We approximate the boundary by a p...
Guido M. Schuster, Aggelos K. Katsaggelos
TCS
2008
13 years 9 months ago
Succinct representations of planar maps
This paper addresses the problem of representing the connectivity information of geometric objects using as little memory as possible. As opposed to raw compression issues, the fo...
Luca Castelli Aleardi, Olivier Devillers, Gilles S...
STOC
2007
ACM
239views Algorithms» more  STOC 2007»
14 years 9 months ago
Approximating minimum bounded degree spanning trees to within one of optimal
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
Mohit Singh, Lap Chi Lau
ISPD
2010
ACM
249views Hardware» more  ISPD 2010»
14 years 3 months ago
A matching based decomposer for double patterning lithography
Double Patterning Lithography (DPL) is one of the few hopeful candidate solutions for the lithography for CMOS process beyond 45nm. DPL assigns the patterns less than a certain di...
Yue Xu, Chris Chu