Sciweavers

7820 search results - page 1400 / 1564
» Formalization of Time and Space
Sort
View
SIGMOD
2002
ACM
129views Database» more  SIGMOD 2002»
16 years 6 months ago
Dwarf: shrinking the PetaCube
Dwarf is a highly compressed structure for computing, storing, and querying data cubes. Dwarf identifies prefix and suffix structural redundancies and factors them out by coalesci...
Yannis Sismanis, Antonios Deligiannakis, Nick Rous...
DCC
2008
IEEE
16 years 6 months ago
Word-Based Statistical Compressors as Natural Language Compression Boosters
Semistatic word-based byte-oriented compression codes are known to be attractive alternatives to compress natural language texts. With compression ratios around 30%, they allow di...
Antonio Fariña, Gonzalo Navarro, José...
SODA
2010
ACM
213views Algorithms» more  SODA 2010»
16 years 3 months ago
Regular Expression Matching with Multi-Strings
Regular expression matching is a key task (and often computational bottleneck) in a variety of software tools and applications. For instance, the standard grep and sed utilities, ...
Philip Bille, Mikkel Thorup
ICS
2010
Tsinghua U.
16 years 3 months ago
Cryptography by Cellular Automata or How Fast Can Complexity Emerge in Nature?
Computation in the physical world is restricted by the following spatial locality constraint: In a single unit of time, information can only travel a bounded distance in space. A ...
Benny Applebaum, Yuval Ishai, Eyal Kushilevitz
SDM
2009
SIAM
119views Data Mining» more  SDM 2009»
16 years 3 months ago
Twin Vector Machines for Online Learning on a Budget.
This paper proposes Twin Vector Machine (TVM), a constant space and sublinear time Support Vector Machine (SVM) algorithm for online learning. TVM achieves its favorable scaling b...
Zhuang Wang, Slobodan Vucetic
« Prev « First page 1400 / 1564 Last » Next »