Sciweavers

15073 search results - page 2810 / 3015
» Probabilistic algorithms for computing resultants
Sort
View
BMCBI
2004
140views more  BMCBI 2004»
15 years 1 months ago
What can we learn from noncoding regions of similarity between genomes?
Background: In addition to known protein-coding genes, large amounts of apparently non-coding sequence are conserved between the human and mouse genomes. It seems reasonable to as...
Thomas A. Down, Tim J. P. Hubbard
PVLDB
2008
107views more  PVLDB 2008»
15 years 1 months ago
Finding relevant patterns in bursty sequences
Sequence data is ubiquitous and finding frequent sequences in a large database is one of the most common problems when analyzing sequence data. Unfortunately many sources of seque...
Alexander Lachmann, Mirek Riedewald
ICCAD
2009
IEEE
132views Hardware» more  ICCAD 2009»
14 years 11 months ago
DynaTune: Circuit-level optimization for timing speculation considering dynamic path behavior
Traditional circuit design focuses on optimizing the static critical paths no matter how infrequently these paths are exercised dynamically. Circuit optimization is then tuned to ...
Lu Wan, Deming Chen
ICCAD
2006
IEEE
139views Hardware» more  ICCAD 2006»
15 years 10 months ago
Analog placement with symmetry and other placement constraints
In order to handle device matching in analog circuits, some pairs of modules are required to be placed symmetrically. This paper addresses this device-level placement problem for ...
Yiu-Cheong Tam, Evangeline F. Y. Young, Chris C. N...
MM
2006
ACM
168views Multimedia» more  MM 2006»
15 years 8 months ago
Scalability of local image descriptors: a comparative study
Computer vision researchers have recently proposed several local descriptor schemes. Due to lack of database support, however, these descriptors have only been evaluated using sma...
Herwig Lejsek, Friðrik Heiðar Ásmun...
« Prev « First page 2810 / 3015 Last » Next »