Sciweavers

11784 search results - page 2020 / 2357
» Interpolation for data structures
Sort
View
APWEB
2005
Springer
15 years 10 months ago
Integrating Web Services into Ontology-Based Web Portal
With the explosive emerged Web services, the Web becomes a world of information and applications. So portals whose goal is presenting a structured view onto the Web should provide ...
Jian Zhou, Yong Yu, Lei Zhang, Chenxi Lin, Yin Yan...
CHES
2005
Springer
149views Cryptology» more  CHES 2005»
15 years 10 months ago
Resistance of Randomized Projective Coordinates Against Power Analysis
Embedded devices implementing cryptographic services are the result of a trade-off between cost, performance and security. Aside from flaws in the protocols and the algorithms us...
William Dupuy, Sébastien Kunz-Jacques
CICLING
2005
Springer
15 years 10 months ago
Incremental Information Extraction Using Tree-Based Context Representations
Abstract. The purpose of information extraction (IE) is to find desired pieces of information in natural language texts and store them in a form that is suitable for automatic pro...
Christian Siefkes
CPM
2005
Springer
109views Combinatorics» more  CPM 2005»
15 years 10 months ago
Using PQ Trees for Comparative Genomics
Permutations on strings representing gene clusters on genomes have been studied earlier in [18, 14, 3, 12, 17] and the idea of a maximal permutation pattern was introduced in [12]....
Gad M. Landau, Laxmi Parida, Oren Weimann
CPM
2005
Springer
101views Combinatorics» more  CPM 2005»
15 years 10 months ago
Succinct Suffix Arrays Based on Run-Length Encoding
A succinct full-text self-index is a data structure built on a text T = t1t2 . . . tn, which takes little space (ideally close to that of the compressed text), permits efficient se...
Veli Mäkinen, Gonzalo Navarro
« Prev « First page 2020 / 2357 Last » Next »