Sciweavers

675 search results - page 111 / 135
» On Compression of Parse Trees
Sort
View
ALMOB
2008
131views more  ALMOB 2008»
13 years 8 months ago
Fast algorithms for computing sequence distances by exhaustive substring composition
The increasing throughput of sequencing raises growing needs for methods of sequence analysis and comparison on a genomic scale, notably, in connection with phylogenetic tree reco...
Alberto Apostolico, Olgert Denas
ICIP
2001
IEEE
14 years 10 months ago
Algorithmic modifications to SPIHT
This paper proposes several low complexity algorithmic modifications to the SPIHT (Set Partitioning in Hierarchical Trees) image coding method of [3]. The modifications exploit un...
Ulug Bayazit, William A. Pearlman
DCC
2005
IEEE
14 years 8 months ago
Error Concealment for Dual Frame Video Coding with Uneven Quality
When losses occur in a transmission of compressed video, the decoder can attempt to conceal the loss by using spatial or temporal methods to estimate the missing macroblocks. We c...
Vijay Chellappa, Pamela C. Cosman, Geoffrey M. Voe...
MOBIQUITOUS
2005
IEEE
14 years 2 months ago
Decentralizing Query Processing in Sensor Networks
Recent research has led to the advent of software systems capable of performing query processing in sensor networks. They perform query processing in a sensor network by construct...
Ross Rosemark, Wang-Chien Lee
EXTREME
2004
ACM
14 years 2 months ago
Half-steps toward LMNL
Overlap in markup occurs where some markup structures do not nest, such as where the sentence and phrase boundaries of a poem and the metrical line structure describe different hi...
Wendell Piez