Sciweavers

1529 search results - page 209 / 306
» On Timing Analysis of Combinational Circuits
Sort
View
COMPGEOM
2010
ACM
14 years 1 months ago
Finding shortest non-trivial cycles in directed graphs on surfaces
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
Sergio Cabello, Éric Colin de Verdiè...
WCRE
2005
IEEE
14 years 1 months ago
When Functions Change Their Names: Automatic Detection of Origin Relationships
It is a common understanding that identifying the same entity such as module, file, and function between revisions is important for software evolution related analysis. Most softw...
Sunghun Kim, Kai Pan, E. James Whitehead Jr.
MM
2006
ACM
175views Multimedia» more  MM 2006»
14 years 2 months ago
The challenge problem for automated detection of 101 semantic concepts in multimedia
We introduce the challenge problem for generic video indexing to gain insight in intermediate steps that affect performance of multimedia analysis methods, while at the same time...
Cees Snoek, Marcel Worring, Jan van Gemert, Jan-Ma...
ICCAD
2008
IEEE
133views Hardware» more  ICCAD 2008»
14 years 5 months ago
Module locking in biochemical synthesis
—We are developing a framework for computation with biochemical reactions with a focus on synthesizing specific logical functionality, a task analogous to technology-independent...
Brian Fett, Marc D. Riedel
ICCAD
2001
IEEE
144views Hardware» more  ICCAD 2001»
14 years 5 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