Sciweavers

11213 search results - page 161 / 2243
» Low-contention data structures
Sort
View
SCOPES
2007
Springer
15 years 10 months ago
Optimization of dynamic data structures in multimedia embedded systems using evolutionary computation
Embedded consumer devices are increasing their capabilities and can now implement new multimedia applications reserved only for powerful desktops a few years ago. These applicatio...
David Atienza, Christos Baloukas, Lazaros Papadopo...
SIGMOD
2003
ACM
190views Database» more  SIGMOD 2003»
15 years 9 months ago
Extracting Structured Data from Web Pages
Many web sites contain large sets of pages generated using a common template or layout. For example, Amazon lays out the author, title, comments, etc. in the same way in all its b...
Arvind Arasu, Hector Garcia-Molina
ICCV
2001
IEEE
16 years 6 months ago
Sparse PCA: Extracting Multi-scale Structure from Data
Chakra Chennubhotla, Allan D. Jepson
STOC
2009
ACM
120views Algorithms» more  STOC 2009»
16 years 4 months ago
Bit-probe lower bounds for succinct data structures
We prove lower bounds on the redundancy necessary to represent a set S of objects using a number of bits close to the information-theoretic minimum log2 |S|, while answering vario...
Emanuele Viola