Sciweavers

1594 search results - page 39 / 319
» Fast Prediction on a Tree
Sort
View
ICCD
2002
IEEE
93views Hardware» more  ICCD 2002»
14 years 4 months ago
Speculative Trace Scheduling in VLIW Processors
VLIW processors are statically scheduled processors and their performance depends on the quality of the compiler’s scheduler. We propose a scheduling scheme where the applicatio...
Manvi Agarwal, S. K. Nandy, Jos T. J. van Eijndhov...
ICDE
2010
IEEE
288views Database» more  ICDE 2010»
14 years 7 months ago
Fast In-Memory XPath Search using Compressed Indexes
A large fraction of an XML document typically consists of text data. The XPath query language allows text search via the equal, contains, and starts-with predicates. Such predicate...
Diego Arroyuelo, Francisco Claude, Sebastian Manet...
GECCO
2003
Springer
14 years 1 months ago
Optimizing the Order of Taxon Addition in Phylogenetic Tree Construction Using Genetic Algorithm
Phylogenetics has gained in public favor for the analysis of DNA sequence data as molecular biology has advanced. Among a number of algorithms for phylogenetics, the fastDNAml is c...
Yong-Hyuk Kim, Seung-Kyu Lee, Byung Ro Moon
CLUSTER
2005
IEEE
14 years 1 months ago
Fast Query Processing by Distributing an Index over CPU Caches
Data intensive applications on clusters often require requests quickly be sent to the node managing the desired data. In many applications, one must look through a sorted tree str...
Xiaoqin Ma, Gene Cooperman
BMCBI
2008
125views more  BMCBI 2008»
13 years 8 months ago
A fast algorithm for the multiple genome rearrangement problem with weighted reversals and transpositions
Background: Due to recent progress in genome sequencing, more and more data for phylogenetic reconstruction based on rearrangement distances between genomes become available. Howe...
Martin Bader, Mohamed Ibrahim Abouelhoda, Enno Ohl...