Sciweavers

915 search results - page 175 / 183
» Maximally Abstract Retrenchments
Sort
View
PATMOS
2000
Springer
15 years 3 months ago
Dynamic Memory Design for Low Data-Retention Power
Abstract. The emergence of data-intensive applications in mobile environments has resulted in portable electronic systems with increasingly large dynamic memories. The typical oper...
Joohee Kim, Marios C. Papaefthymiou
SC
1995
ACM
15 years 3 months ago
Parallelizing the Phylogeny Problem
The problem of determining the evolutionary history of species in the form of phylogenetic trees is known as the phylogeny problem. We present a parallelization of the character c...
Jeff A. Jones, Katherine A. Yelick
ASPDAC
2008
ACM
104views Hardware» more  ASPDAC 2008»
15 years 1 months ago
Variability-driven module selection with joint design time optimization and post-silicon tuning
Abstract-- Increasing delay and power variation are significant challenges to the designers as technology scales to the deep sub-micron (DSM) regime. Traditional module selection t...
Feng Wang 0004, Xiaoxia Wu, Yuan Xie
CPM
2005
Springer
100views Combinatorics» more  CPM 2005»
15 years 1 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
ACCV
2007
Springer
15 years 1 months ago
A Convex Programming Approach to the Trace Quotient Problem
Abstract. The trace quotient problem arises in many applications in pattern classification and computer vision, e.g., manifold learning, low-dimension embedding, etc. The task is ...
Chunhua Shen, Hongdong Li, Michael J. Brooks