Sciweavers

4940 search results - page 920 / 988
» On the Complexity of Universal Programs
Sort
View
MICRO
2006
IEEE
127views Hardware» more  MICRO 2006»
14 years 3 months ago
A Predictive Performance Model for Superscalar Processors
Designing and optimizing high performance microprocessors is an increasingly difficult task due to the size and complexity of the processor design space, high cost of detailed si...
P. J. Joseph, Kapil Vaswani, Matthew J. Thazhuthav...
BIBE
2005
IEEE
126views Bioinformatics» more  BIBE 2005»
14 years 3 months ago
Highly Scalable and Accurate Seeds for Subsequence Alignment
We propose a method for finding seeds for the local alignment of two nucleotide sequences. Our method uses randomized algorithms to find approximate seeds. We present a dynamic ...
Abhijit Pol, Tamer Kahveci
ASPDAC
2005
ACM
97views Hardware» more  ASPDAC 2005»
14 years 3 months ago
Opportunities and challenges for better than worst-case design
The progressive trend of fabrication technologies towards the nanometer regime has created a number of new physical design challenges for computer architects. Design complexity, u...
Todd M. Austin, Valeria Bertacco, David Blaauw, Tr...
MIR
2005
ACM
197views Multimedia» more  MIR 2005»
14 years 3 months ago
Enhanced ontologies for video annotation and retrieval
A typical way to perform video annotation requires to classify video elements (e.g. events and objects) according to some pre-defined ontology of the video content domain. Ontolo...
Marco Bertini, Alberto Del Bimbo, Carlo Torniai
PODC
2005
ACM
14 years 3 months ago
On the locality of bounded growth
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer