Sciweavers

581 search results - page 17 / 117
» An Automata Model for Trees with Ordered Data Values
Sort
View
ICDE
2007
IEEE
228views Database» more  ICDE 2007»
15 years 6 months ago
A General Cost Model for Dimensionality Reduction in High Dimensional Spaces
Similarity search usually encounters a serious problem in the high dimensional space, known as the “curse of dimensionality”. In order to speed up the retrieval efficiency, p...
Xiang Lian, Lei Chen 0002
POPL
2006
ACM
16 years 17 hour ago
Polymorphic regular tree types and patterns
We propose a type system based on regular tree grammars, where algebraic datatypes are interpreted in a structural way. Thus, the same constructors can be reused for different typ...
Jerome Vouillon
DAGSTUHL
2006
15 years 1 months ago
Efficient Software Model Checking of Data Structure Properties
This paper presents novel language and analysis techniques that significantly speed up software model checking of data structure properties. Consider checking a red-black tree imp...
Chandrasekhar Boyapati, Paul T. Darga
DCC
2004
IEEE
15 years 11 months ago
Fast Compression with a Static Model in High-Order Entropy
We report on a simple encoding format called wzip for decompressing block-sorting transforms, such as the Burrows-Wheeler Transform (BWT). Our compressor uses the simple notions o...
Luca Foschini, Roberto Grossi, Ankur Gupta, Jeffre...
INFOCOM
2010
IEEE
14 years 9 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