1170 search results - page 35 / 234 » How Fast Is Too Fast |
83
Voted
ICC
2009
IEEE
15 years 7 months ago
2009
IEEE
—Opportunistic Routing (OR) has been considered as one promising technique to overcome the unreliability of the wireless medium by collaborating multiple neighboring receivers/ca...
97
Voted
ICPR
2008
IEEE
15 years 7 months ago
2008
IEEE
Active set methods for training the Support Vector Machines (SVM) are advantageous since they enable incremental training and, as we show in this research, do not exhibit exponent...
98
Voted
ACCV
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. Computation time is an important performance characteristic of computer vision algorithms. This paper shows how existing (slow) binary-valued decision algorithms can be a...
98
Voted
DAGM
2005
Springer
15 years 6 months ago
2005
Springer
Filtering a signal with a finite impulse response (FIR) filter introduces dependencies between the errors in the filtered image due to overlapping filter masks. If the filteri...
140
Voted
ICANN
2005
Springer
15 years 6 months ago
2005
Springer
Small mobile robots typically have little on-board processing power for time-consuming vision algorithms. Here we show how they can quickly extract very dense yet highly useful inf...