692 search results - page 53 / 139 » BDD minimization for approximate computing |
ICASSP
2011
IEEE
14 years 2 months ago
2011
IEEE
Traditional binary hypothesis testing relies on the precise knowledge of the probability density of an observed random vector conditioned on each hypothesis. However, for many app...
67
Voted
CCCG
2006
15 years 9 days ago
2006
Given two sets A and B of n points each in R2 , we study the problem of computing a matching between A and B that minimizes the root mean square (rms) distance of matched pairs. W...
105
click to vote
AINA
2007
IEEE
15 years 5 months ago
2007
IEEE
The construction of multicast trees is complicated by the need to balance a number of important objectives, including: minimizing latencies, minimizing depth/hops, and bounding th...
ICC
2007
IEEE
15 years 5 months ago
2007
IEEE
Abstract— This paper proposes a new MIMO-OFDM precoding method that minimizes BER of the maximum likelihood detection (MLD). Conventional MIMO precoding methods can approximately...
89
Voted
INFOCOM
2009
IEEE
15 years 5 months ago
2009
IEEE
Abstract—Path computation elements (PCE’s) are used to compute end-to-end paths across multiple areas. Multiple PCE’s may be dedicated to each area to provide sufficient path...