104 search results - page 14 / 21 » Efficient Algorithms for k Maximum Sums |
FPGA
2004
ACM
13 years 11 months ago
2004
ACM
Pattern matching for network security and intrusion detection demands exceptionally high performance. Much work has been done in this field, and yet there is still significant roo...
ICFHR
2010
13 years 2 months ago
2010
There are many video images where hand written text may appear. Therefore handwritten scene text detection in video is essential and useful for many applications for efficient ind...
APPROX
2010
Springer
13 years 9 months ago
2010
Springer
We give a simple combinatorial proof of the Chernoff-Hoeffding concentration bound [Che52, Hoe63], which says that the sum of independent {0, 1}-valued random variables is highly ...
SIGECOM
2003
ACM
14 years 19 days ago
2003
ACM
We investigate the problem of matching buyers and sellers in a multi-item multi-unit combinatorial exchange so as to maximize either the surplus (revenue minus cost) or the tradin...
ICANN
2009
Springer
13 years 12 months ago
2009
Springer
Kernel density estimation (KDE) has been used in many computational intelligence and computer vision applications. In this paper we propose a Bayesian estimation method for findin...