Sciweavers

1170 search results - page 73 / 234
» How Fast Is Too Fast
Sort
View
SAGT
2010
Springer
160views Game Theory» more  SAGT 2010»
15 years 1 months ago
How Do You Like Your Equilibrium Selection Problems? Hard, or Very Hard?
The PPAD-completeness of Nash equilibrium computation is taken as evidence that the problem is computationally hard in the worst case. This evidence is necessarily rather weak, in ...
Paul W. Goldberg
TON
2008
124views more  TON 2008»
15 years 2 months ago
Designing packet buffers for router linecards
-- Internet routers and Ethernet switches contain packet buffers to hold packets during times of congestion. Packet buffers are at the heart of every packet switch and router, whic...
Sundar Iyer, Ramana Rao Kompella, Nick McKeown
CVPR
2008
IEEE
16 years 5 months ago
Accurate and robust registration for in-hand modeling
We present fast 3D surface registration methods for inhand modeling. This allows users to scan complete objects swiftly by simply turning them around in front of the scanner. The ...
Thibaut Weise, Bastian Leibe, Luc J. Van Gool
ICCV
2003
IEEE
16 years 4 months ago
3D Tracking = Classification + Interpolation
Hand gestures are examples of fast and complex motions. Computers fail to track these in fast video, but sleight of hand fools humans as well: what happens too quickly we just can...
Carlo Tomasi, Slav Petrov, Arvind Sastry
IJCNN
2007
IEEE
15 years 9 months ago
Compact hardware for real-time speech recognition using a Liquid State Machine
Abstract— Hardware implementations of Spiking Neural Networks are numerous because they are well suited for implementation in digital and analog hardware, and outperform classic ...
Benjamin Schrauwen, Michiel D'Haene, David Verstra...