Sciweavers

847 search results - page 109 / 170
» Approximation algorithms for projective clustering
Sort
View
115
Voted
DCC
2005
IEEE
16 years 10 days ago
Towards Practical Minimum-Entropy Universal Decoding
Minimum-entropy decoding is a universal decoding algorithm used in decoding block compression of discrete memoryless sources as well as block transmission of information across di...
Todd P. Coleman, Muriel Médard, Michelle Ef...
SIGIR
1998
ACM
15 years 5 months ago
Fast Searching on Compressed Text Allowing Errors
Abstract We present a fast compression and decompression scheme for natural language texts that allows e cient and exible string matching by searching the compressed text directly....
Edleno Silva de Moura, Gonzalo Navarro, Nivio Zivi...
107
Voted
ICAD
2004
15 years 2 months ago
Reeds: A Responsive Sound Installation
This paper discusses the responsive sound installation Reeds. The Melbourne International Festival of the Arts commissioned the Reeds project in 2000, for exhibition on the Orname...
Garth Paine
COMCOM
2006
168views more  COMCOM 2006»
15 years 24 days ago
Relay node placement in large scale wireless sensor networks
Scalability and extended lifetime are two critical design goals of any large scale wireless sensor network. A two-tiered network model has been proposed recently for this purpose....
Jian Tang, Bin Hao, Arunabha Sen
111
Voted
ICIP
2005
IEEE
16 years 2 months ago
The M-term pursuit for image representation and progressive compression
This paper introduces a sparse signal representation algorithm in redundant dictionaries, called the M-Term Pursuit (MTP), with an application to image representation and scalable ...
Adel Rahmoune, Pierre Vandergheynst, Pascal Frossa...