Sciweavers

23 search results - page 4 / 5
» A Polynomial-Time Algorithm for the Matching of Crossing Con...
Sort
View
DAC
2004
ACM
14 years 6 months ago
Architecture-level synthesis for automatic interconnect pipelining
For multi-gigahertz synchronous designs in nanometer technologies, multiple clock cycles are needed to cross the global interconnects, thus making it necessary to have pipelined g...
Jason Cong, Yiping Fan, Zhiru Zhang
GECCO
2010
Springer
155views Optimization» more  GECCO 2010»
13 years 10 months ago
Negative selection algorithms without generating detectors
Negative selection algorithms are immune-inspired classifiers that are trained on negative examples only. Classification is performed by generating detectors that match none of ...
Maciej Liskiewicz, Johannes Textor
BIBM
2008
IEEE
112views Bioinformatics» more  BIBM 2008»
13 years 12 months ago
Fast Alignments of Metabolic Networks
Network alignments are extensively used for comparing, exploring, and predicting biological networks. Existing alignment tools are mostly based on isomorphic and homeomorphic embe...
Qiong Cheng, Piotr Berman, Robert W. Harrison, Ale...
IADIS
2009
13 years 3 months ago
Out-of-scene AV data detection
In this paper, we propose a new approach for the automatic audio-based out-of-scene detection of audio-visual data, recorded by different cameras, camcorders or mobile phones duri...
Danil Korchagin
COCO
2009
Springer
128views Algorithms» more  COCO 2009»
13 years 12 months ago
An Almost Optimal Rank Bound for Depth-3 Identities
—We show that the rank of a depth-3 circuit (over any field) that is simple, minimal and zero is at most O(k3 log d). The previous best rank bound known was 2O(k2 ) (log d)k−2...
Nitin Saxena, C. Seshadhri