Sciweavers

2661 search results - page 509 / 533
» Quantum Complexity Classes
Sort
View
ASPDAC
2008
ACM
154views Hardware» more  ASPDAC 2008»
15 years 2 months ago
Exploring high-speed low-power hybrid arithmetic units at scaled supply and adaptive clock-stretching
Meeting power and performance requirement is a challenging task in high speed ALUs. Supply voltage scaling is promising because it reduces both switching and active power but it al...
Swaroop Ghosh, Kaushik Roy
ASPLOS
2008
ACM
15 years 2 months ago
Optimistic parallelism benefits from data partitioning
Recent studies of irregular applications such as finite-element mesh generators and data-clustering codes have shown that these applications have a generalized data parallelism ar...
Milind Kulkarni, Keshav Pingali, Ganesh Ramanaraya...
89
Voted
ATAL
2008
Springer
15 years 2 months ago
Programming agents as a means of capturing self-strategy
In this paper we report results of an extensive evaluation of people's ability to reproduce the strategies they use in simple real-life settings. Having the ability to reliab...
Michal Chalamish, David Sarne, Sarit Kraus
BIRD
2008
Springer
162views Bioinformatics» more  BIRD 2008»
15 years 2 months ago
Suffix Tree Characterization of Maximal Motifs in Biological Sequences
Finding motifs in biological sequences is one of the most intriguing problems for string algorithms designers due to, on the one hand, the numerous applications of this problem in...
Maria Federico, Nadia Pisanti
122
Voted
CPM
2005
Springer
100views Combinatorics» more  CPM 2005»
15 years 2 months ago
Hardness of Optimal Spaced Seed Design
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
François Nicolas, Eric Rivals