Sciweavers

11211 search results - page 68 / 2243
» Rank-Sensitive Data Structures
Sort
View
ICASSP
2011
IEEE
13 years 2 months ago
Optimal structure of memory models for lossless compression of binary image contours
In this paper we study various chain codes, which are representations of binary image contours, in terms of their ability to compress in the best way the contour information using...
Ioan Tabus, Septimia Sarbu
CGF
2010
181views more  CGF 2010»
13 years 9 months ago
Matrix Trees
Recent advances in GPU programmability and architecture have allowed for the generation of ray casted or ray traced images at interactive rates. How quickly these images can be ge...
Nathan Andrysco, Xavier Tricoche
INFOCOM
2010
IEEE
13 years 9 months ago
Building Scalable Virtual Routers with Trie Braiding
—Many popular algorithms for fast packet forwarding and filtering rely on the tree data structure. Examples are the trie-based IP lookup and packet classification algorithms. W...
Haoyu Song, Murali S. Kodialam, Fang Hao, T. V. La...
WEBDB
2001
Springer
92views Database» more  WEBDB 2001»
14 years 3 months ago
Generating Synthetic Complex-Structured XML Data
Synthetically generated data has always been important for evaluating and understanding new ideas in database research. In this paper, we describe a data generator for generating ...
Ashraf Aboulnaga, Jeffrey F. Naughton, Chun Zhang
CN
1998
58views more  CN 1998»
13 years 10 months ago
A solid modeling library for the World Wide Web
A library of functions for the creation, manipulation, and viewing of solid models was created for deployment on the World Wide Web. The core data structure was based on the halfe...
Stephen Chi-fai Chan, Vincent T. Y. Ng, Albert S. ...