Sciweavers

65 search results - page 7 / 13
» An Approach to Graph and Netlist Compression
Sort
View
INFOCOM
2010
IEEE
14 years 7 months ago
On Computing Compression Trees for Data Collection in Wireless Sensor Networks
We address the problem of efficiently gathering correlated data from a wireless sensor network, with the aim of designing algorithms with provable optimality guarantees, and unders...
Jian Li, Amol Deshpande, Samir Khuller
BIRTHDAY
2010
Springer
15 years 4 months ago
Extended Compact Web Graph Representations
Abstract. Many relevant Web mining tasks translate into classical algorithms on the Web graph. Compact Web graph representations allow running these tasks on larger graphs within m...
Francisco Claude, Gonzalo Navarro
CORR
2011
Springer
181views Education» more  CORR 2011»
14 years 4 months ago
Compressed String Dictionaries
The problem of storing a set of strings – a string dictionary – in compact form appears naturally in many cases. While classically it has represented a small part of the whole ...
Nieves R. Brisaboa, Rodrigo Cánovas, Miguel...
ISPD
2007
ACM
151views Hardware» more  ISPD 2007»
14 years 11 months ago
Pattern sensitive placement for manufacturability
When VLSI technology scales toward 45nm, the lithography wavelength stays at 193nm. This large gap results in strong refractive effects in lithography. Consequently, it is a huge...
Shiyan Hu, Jiang Hu
SSPR
2010
Springer
14 years 7 months ago
Extracting Plane Graphs from Images
Abstract. In order to use structural techniques from graph-based pattern recognition, a first necessary step consists in extracting a graph in an automatic way from an image. We pr...
Émilie Samuel, Colin de la Higuera, Jean-Ch...