4110 search results - page 258 / 822 » Efficient algorithms for the 2-gathering problem |
153
click to vote
ICIP
2008
IEEE
16 years 1 months ago
2008
IEEE
Face representation based on the Visual Codebook becomes popular because of its excellent recognition performance, in which the critical problem is how to learn the most efficien...
161
click to vote
LCN
2007
IEEE
16 years 26 days ago
2007
IEEE
- Multiple distribution trees and multiple description (MD) coding are highly robust since they provide redundancy both in network paths and data. However, MD coded streaming inclu...
192
click to vote
NIPS
2000
15 years 8 months ago
2000
We introduce a method of feature selection for Support Vector Machines. The method is based upon finding those features which minimize bounds on the leave-one-out error. This sear...
176
click to vote
COLING
1996
15 years 8 months ago
1996
Automatic compilation of the linking relation employed in certain parsing algorithms for context-free languages is examined. Special problems arise in the extension of these algor...
180
click to vote
TMC
2010
15 years 5 months ago
2010
—To satisfy the stringent requirement of capacity enhancement in wireless networks, cooperative relaying is envisioned as one of the most effective solutions. In this paper, we s...