Sciweavers

1887 search results - page 274 / 378
» An efficient search algorithm for partially ordered sets
Sort
View
ICCAD
2001
IEEE
144views Hardware» more  ICCAD 2001»
14 years 4 months ago
Faster SAT and Smaller BDDs via Common Function Structure
The increasing popularity of SAT and BDD techniques in verification and synthesis encourages the search for additional speed-ups. Since typical SAT and BDD algorithms are exponent...
Fadi A. Aloul, Igor L. Markov, Karem A. Sakallah
ICIP
2005
IEEE
14 years 9 months ago
A genetic algorithm-based approach to knowledge-assisted video analysis
Efficient video content management and exploitation requires extraction of the underlying semantics, a non-trivial task associating low-level features of the image domain and high...
Frédéric Precioso, Ioannis Kompatsia...
ICIP
2009
IEEE
13 years 5 months ago
An automatic Structure-Aware image extrapolation applied to error concealment
A novel framework for spatially estimating unknown image data is presented. Common applications include inpainting, concealment of transmission errors, prediction in video coding,...
Haricharan Lakshman, Patrick Ndjiki-Nya, Martin K&...
BMCBI
2008
124views more  BMCBI 2008»
13 years 8 months ago
A relation based measure of semantic similarity for Gene Ontology annotations
Background: Various measures of semantic similarity of terms in bio-ontologies such as the Gene Ontology (GO) have been used to compare gene products. Such measures of similarity ...
Brendan Sheehan, Aaron J. Quigley, Benoit Gaudin, ...
ISAAC
2004
Springer
112views Algorithms» more  ISAAC 2004»
14 years 1 months ago
Dynamic Tree Cross Products
Abstract. Range searching over tree cross products – a variant of classic range searching – recently has been introduced by Buchsbaum et al. (Proc. 8th ESA, vol. 1879 of LNCS, ...
Marcus Raitner