Sciweavers

2930 search results - page 223 / 586
» The optimal sequence compression
Sort
View
DCC
2002
IEEE
16 years 5 months ago
Bit Allocation in Sub-linear Time and the Multiple-Choice Knapsack Problem
We show that the problem of optimal bit allocation among a set of independent discrete quantizers given a budget constraint is equivalent to the multiple choice knapsack problem (...
Alexander E. Mohr
ADHOCNOW
2008
Springer
15 years 6 months ago
An Energy-Efficient Query Aggregation Scheme for Wireless Sensor Networks
This paper presents a novel method for optimizing sliding window based continuous queries. We deal with two categories of aggregation operations: stepwise aggregation (e.g. COUNT) ...
Jun-Zhao Sun
CSB
2005
IEEE
223views Bioinformatics» more  CSB 2005»
15 years 11 months ago
Automatic Protein Function Annotation through Candidate Ortholog Clusters from Incomplete Genomes
Annotation of protein function often arises in the context of partially complete genomes but is not adequately addressed. We present an annotation method by extracting ortholog cl...
Akshay Vashist, Casimir A. Kulikowski, Ilya B. Muc...
VLSID
2004
IEEE
209views VLSI» more  VLSID 2004»
16 years 6 months ago
An Architecture for Motion Estimation in the Transform Domain
demanding algorithm of a video encoder. It is known that about 60% ~ 80% of the total computation time is consumed for motion estimation [1]. The second is its high impact on the v...
J. Lee, Narayanan Vijaykrishnan, Mary Jane Irwin, ...
163
Voted
ACL
1996
15 years 7 months ago
Linguistic Structure as Composition and Perturbation
This paper discusses the problem of learning language from unprocessed text and speech signals, concentrating on the problem of learning a lexicon. In particular, it argues for a ...
Carl de Marcken