Sciweavers

83 search results - page 7 / 17
» An Improved Redundancy Elimination Algorithm for Underspecif...
Sort
View
TSP
2008
124views more  TSP 2008»
13 years 7 months ago
Dictionary Preconditioning for Greedy Algorithms
This article introduces the concept of sensing dictionaries. It presents an alteration of greedy algorithms like thresholding or (Orthogonal) Matching Pursuit which improves their...
Karin Schnass, Pierre Vandergheynst
DCC
2005
IEEE
14 years 7 months ago
Efficient Alphabet Partitioning Algorithms for Low-Complexity Entropy Coding
We analyze the technique for reducing the complexity of entropy coding consisting in the a priori grouping of the source alphabet symbols, and in dividing the coding process in tw...
Amir Said
AICCSA
2006
IEEE
168views Hardware» more  AICCSA 2006»
14 years 1 months ago
Power Efficient Algorithms for Computing Fast Fourier Transform over Wireless Sensor Networks
Collaborative signal processing is one of the most promising applications that are currently being investigated for sensor networks. In this paper, we use FFT computation as a veh...
Turkmen Canli, Ajay K. Gupta, Ashfaq A. Khokhar
SIGMOD
2002
ACM
129views Database» more  SIGMOD 2002»
14 years 7 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...
COLING
2010
13 years 2 months ago
Improving the Quality of Text Understanding by Delaying Ambiguity Resolution
Text Understanding systems often commit to a single best interpretation of a sentence before analyzing subsequent text. This interpretation is chosen by resolving ambiguous altern...
Doo Soon Kim, Ken Barker, Bruce W. Porter