Sciweavers

419 search results - page 39 / 84
» First Order Paths in Ordered Trees
Sort
View
EOR
2002
84views more  EOR 2002»
13 years 9 months ago
Solving container loading problems by block arrangement
In order to solve heterogeneous single and multiple container loading problems, an algorithm is presented that builds homogeneous blocks of identically orientated items. First a g...
Michael Eley
ICDE
2008
IEEE
132views Database» more  ICDE 2008»
14 years 11 months ago
Greedy List Intersection
A common technique for processing conjunctive queries is to first match each predicate separately using an index lookup, and then compute the intersection of the resulting rowid li...
Robert Krauthgamer, Aranyak Mehta, Vijayshankar Ra...
RECOMB
2006
Springer
14 years 10 months ago
Evolution of Tandemly Repeated Sequences Through Duplication and Inversion
Abstract. Given a phylogenetic tree T for a family of tandemly repeated genes and their signed order O on the chromosome, we aim to find the minimum number of inversions compatible...
Denis Bertrand, Mathieu Lajoie, Nadia El-Mabrouk, ...
SPAA
1990
ACM
14 years 1 months ago
Optimal Cooperative Search in Fractional Cascaded Data Structures
Fractional cascading is a technique designed to allow e cient sequential search in a graph with catalogs of total size n. The search consists of locating a key in the catalogs alo...
Roberto Tamassia, Jeffrey Scott Vitter
JSAC
2008
73views more  JSAC 2008»
13 years 9 months ago
Quasi-Dynamic Network Design Considering Different Service Holding Times
Abstract-- We propose a quasi-dynamic network design algorithm considering traffic growth in multi-layered photonic networks that consist of electrical paths and optical paths. The...
Koichi Kanie, Hiroshi Hasegawa, Ken-ichi Sato