Sciweavers

6192 search results - page 342 / 1239
» Structure benefits all
Sort
View
IPL
2002
59views more  IPL 2002»
15 years 7 months ago
An efficient decoding technique for Huffman codes
We present a new data structure for Huffman coding in which in addition to sending symbols in order of their appearance in the Huffman tree one needs to send codes of all circular...
Rezaul Alam Chowdhury, M. Kaykobad, Irwin King
LOGCOM
1998
110views more  LOGCOM 1998»
15 years 7 months ago
leanTAP Revisited
A sequent calculus of a new sort is extracted from the Prolog program leanTAP. This calculus is sound and complete, even though it lacks almost all structural rules. Thinking of l...
Melvin Fitting
PRL
1998
108views more  PRL 1998»
15 years 7 months ago
Determining local natural scales of curves
An alternative to representing curves at a single scale or a fixed number of multiple scales is to represent them only at their natural (i.e. most significant) scales. This allo...
Paul L. Rosin
BIBE
2005
IEEE
121views Bioinformatics» more  BIBE 2005»
16 years 1 months ago
RNA Pseudoknot Prediction Using Term Rewriting
RNA plays a critical role in mediating every step of cellular information transfer from genes to functional proteins. Pseudoknots are widely occurring structural motifs found in a...
Xuezheng Fu, Hao Wang, William L. Harrison, Robert...
ICDT
2005
ACM
88views Database» more  ICDT 2005»
16 years 1 months ago
When Is Nearest Neighbors Indexable?
Abstract. In this paper, we consider whether traditional index structures are effective in processing unstable nearest neighbors workloads. It is known that under broad conditions...
Uri Shaft, Raghu Ramakrishnan