Sciweavers

4432 search results - page 538 / 887
» Solving Demodulation as an Optimization Problem
Sort
View
165
Voted
CIAC
2006
Springer
278views Algorithms» more  CIAC 2006»
15 years 7 months ago
Covering a Set of Points with a Minimum Number of Lines
We consider the minimum line covering problem: given a set S of n points in the plane, we want to find the smallest number l of straight lines needed to cover all n points in S. W...
Magdalene Grantson, Christos Levcopoulos
119
Voted
DAC
1995
ACM
15 years 7 months ago
Register Allocation and Binding for Low Power
This paper describes a technique for calculating the switching activity of a set of registers shared by di erent data values. Based on the assumption that the joint pdf (probabili...
Jui-Ming Chang, Massoud Pedram
131
Voted
ANTSW
2008
Springer
15 years 5 months ago
Two-Level ACO for Haplotype Inference Under Pure Parsimony
Abstract. Haplotype Inference is a challenging problem in bioinformatics that consists in inferring the basic genetic constitution of diploid organisms on the basis of their genoty...
Stefano Benedettini, Andrea Roli, Luca Di Gaspero
122
Voted
ASPDAC
2005
ACM
114views Hardware» more  ASPDAC 2005»
15 years 5 months ago
Redundant-via enhanced maze routing for yield improvement
- Redundant via insertion is a good solution to reduce the yield loss by via failure. However, the existing methods are all post-layout optimizations that insert redundant via afte...
Gang Xu, Li-Da Huang, David Z. Pan, Martin D. F. W...
135
Voted
NIPS
2008
15 years 4 months ago
Deflation Methods for Sparse PCA
In analogy to the PCA setting, the sparse PCA problem is often solved by iteratively alternating between two subtasks: cardinality-constrained rank-one variance maximization and m...
Lester Mackey