Sciweavers

138 search results - page 16 / 28
» Lower Bounds for Succinct Data Structures
Sort
View
215
Voted
GIS
2007
ACM
16 years 4 months ago
TS2-tree - an efficient similarity based organization for trajectory data
The increasingly popular GPS technology and the growing amount of trajectory data it generates create the need for developing applications that efficiently store and query traject...
Petko Bakalov, Eamonn J. Keogh, Vassilis J. Tsotra...
133
Voted
TVLSI
2008
133views more  TVLSI 2008»
15 years 3 months ago
Test Data Compression Using Selective Encoding of Scan Slices
We present a selective encoding method that reduces test data volume and test application time for scan testing of Intellectual Property (IP) cores. This method encodes the slices ...
Zhanglei Wang, Krishnendu Chakrabarty
120
Voted
IM
2006
15 years 3 months ago
Estimating Entropy and Entropy Norm on Data Streams
We consider the problem of computing information theoretic functions such as entropy on a data stream, using sublinear space. Our first result deals with a measure we call the &quo...
Amit Chakrabarti, Khanh Do Ba, S. Muthukrishnan
135
Voted
IMR
2004
Springer
15 years 9 months ago
Non-Replicating Indexing for Out-Of-Core Processing of Semi-Regular Triangular Surface Meshes
We introduce an indexing scheme for the vertices of semi-regular meshes, based on interleaving quadtrees rooted on the edges of the base mesh. Using this indexing scheme we develo...
Igor Guskov
126
Voted
STOC
2006
ACM
121views Algorithms» more  STOC 2006»
15 years 9 months ago
On adequate performance measures for paging
Memory management is a fundamental problem in computer architecture and operating systems. We consider a two-level memory system with fast, but small cache and slow, but large mai...
Konstantinos Panagiotou, Alexander Souza