Sciweavers

7840 search results - page 156 / 1568
» On generalized Ramsey numbers
Sort
View
83
Voted
STOC
2003
ACM
95views Algorithms» more  STOC 2003»
16 years 1 months ago
Random knapsack in expected polynomial time
In this paper, we present the first average-case analysis proving an expected polynomial running time for an exact algorithm for the 0/1 knapsack problem. In particular, we prove,...
René Beier, Berthold Vöcking
96
Voted
TMC
2010
109views more  TMC 2010»
14 years 11 months ago
On the Performance Bounds of Practical Wireless Network Coding
—Network coding is an attracting technology that has been shown to be able to improve the throughput of wireless networks. However, there still lacks fundamental understanding on...
Jilin Le, John C. S. Lui, Dah-Ming Chiu
115
Voted
DAC
2007
ACM
16 years 1 months ago
Optimization of Area in Digital FIR Filters using Gate-Level Metrics
In the paper, we propose a new metric for the minimization of area in the generic problem of multiple constant multiplications, and demonstrate its effectiveness for digital FIR f...
Eduardo A. C. da Costa, José C. Monteiro, L...
ICNP
2003
IEEE
15 years 6 months ago
Characterizing Overlay Multicast Networks
Overlay networks among cooperating hosts have recently emerged as a viable solution to several challenging problems, including multicasting, routing, content distribution, and pee...
Sonia Fahmy, Minseok Kwon
84
Voted
CVPR
1996
IEEE
15 years 4 months ago
Pattern Rejection
The e ciency of pattern recognition is particularly crucial in two scenarios; whenever there are a large number of classes to discriminate, and, whenever recognition must be perfo...
Simon Baker, Shree K. Nayar