Sciweavers

240 search results - page 35 / 48
» Using Distance Estimates in Heuristic Search
Sort
View
DATE
2009
IEEE
118views Hardware» more  DATE 2009»
14 years 2 months ago
Gate sizing for large cell-based designs
—Today, many chips are designed with predefined discrete cell libraries. In this paper we present a new fast gate sizing algorithm that works natively with discrete cell choices...
Stephan Held
RECOMB
2002
Springer
14 years 8 months ago
Phase-independent rhythmic analysis of genome-wide expression patterns
We introduce a model-based analysis technique for extracting and characterizing rhythmic expression pro les from genome-wide DNA microarray hybridization data. These patterns are ...
Christopher James Langmead, Anthony K. Yan, C. Rob...
EDBT
2012
ACM
247views Database» more  EDBT 2012»
11 years 10 months ago
Heuristics-based query optimisation for SPARQL
Query optimization in RDF Stores is a challenging problem as SPARQL queries typically contain many more joins than equivalent relational plans, and hence lead to a large join orde...
Petros Tsialiamanis, Lefteris Sidirourgos, Irini F...
ICIP
2001
IEEE
14 years 9 months ago
Region-based color image indexing and retrieval
In this paper a region-based color image indexing and retrieval algorithm is presented. As a basis for the indexing, a novel K-Means segmentation algorithm is used, modified so as...
Ioannis Kompatsiaris, Evagelia Triantafillou, Mich...
ICALP
2005
Springer
14 years 1 months ago
Optimal Spaced Seeds for Faster Approximate String Matching
Filtering is a standard technique for fast approximate string matching in practice. In filtering, a quick first step is used to rule out almost all positions of a text as possib...
Martin Farach-Colton, Gad M. Landau, Süleyman...