Sciweavers

921 search results - page 112 / 185
» New Data Structures for Orthogonal Range Searching
Sort
View
MSV
2004
15 years 5 months ago
S(b)-Trees: An Optimal Balancing of Variable Length Keys
The paper studies the problem of maintaining external dynamic dictionaries with variable length keys. We introduce a new type of balanced trees, called S(b)-trees, which generaliz...
Konstantin V. Shvachko
ELECTRONICMARKETS
1998
117views more  ELECTRONICMARKETS 1998»
15 years 4 months ago
Towards Open Electronic Contracting
AbstractAbstractAbstractAbstract A design and pilot implementation of a system, called InterProcs, supporting electronic contracting is presented. A key concept in the design of th...
Ronald M. Lee
BMCBI
2005
132views more  BMCBI 2005»
15 years 4 months ago
Kalign - an accurate and fast multiple sequence alignment algorithm
Background: The alignment of multiple protein sequences is a fundamental step in the analysis of biological data. It has traditionally been applied to analyzing protein families f...
Timo Lassmann, Erik L. L. Sonnhammer
CIKM
2008
Springer
15 years 6 months ago
Dr. Searcher and Mr. Browser: a unified hyperlink-click graph
We introduce a unified graph representation of the Web, which includes both structural and usage information. We model this graph using a simple union of the Web's hyperlink ...
Barbara Poblete, Carlos Castillo, Aristides Gionis
PVLDB
2010
103views more  PVLDB 2010»
15 years 2 months ago
Fast Optimal Twig Joins
In XML search systems twig queries specify predicates on node values and on the structural relationships between nodes, and a key operation is to join individual query node matche...
Nils Grimsmo, Truls Amundsen Bjørklund, Mag...