485 search results - page 27 / 97 » Iterative Bounding LAO |
COMPGEOM
2006
ACM
15 years 6 months ago
2006
ACM
The k-means method is an old but popular clustering algorithm known for its observed speed and its simplicity. Until recently, however, no meaningful theoretical bounds were known...
TCOM
2008
15 years 14 days ago
2008
In this paper, we derive closed form upper bounds on the error probability of low-density parity-check (LDPC) coded modulation schemes operating on quasi-static fading channels. Th...
123
Voted
INFOCOM
2011
IEEE
14 years 4 months ago
2011
IEEE
— Opportunistic routing is proposed to improve the performance of wireless networks by exploiting the broadcast nature and spatial diversity of the wireless medium. In this paper...
DAC
1996
ACM
15 years 4 months ago
1996
ACM
Abstract -- This paper presents a novel, Boolean approach to LUTbased FPGA technology mapping targeting high performance. As the core of the approach, we have developed a powerful ...
103
click to vote
CONSTRAINTS
2008
15 years 20 days ago
2008
Abstract. A very challenging problem in the genetics domain is to infer haplotypes from genotypes. This process is expected to identify genes affecting health, disease and response...