Sciweavers

9736 search results - page 2 / 1948
» How Fast Can We Compute Products
Sort
View
ICS
2010
Tsinghua U.
14 years 7 months ago
Cryptography by Cellular Automata or How Fast Can Complexity Emerge in Nature?
Computation in the physical world is restricted by the following spatial locality constraint: In a single unit of time, information can only travel a bounded distance in space. A ...
Benny Applebaum, Yuval Ishai, Eyal Kushilevitz
CHI
2003
ACM
14 years 10 months ago
Spam, spam, spam, spam: how can we stop it
Jenny Preece, Jonathan Lazar, Elizabeth F. Churchi...
DAC
2005
ACM
14 years 10 months ago
Statistical static timing analysis: how simple can we get?
Chirayu S. Amin, Noel Menezes, Kip Killpack, Flore...
3DPVT
2006
IEEE
162views Visualization» more  3DPVT 2006»
14 years 3 months ago
How Far Can We Go with Local Optimization in Real-Time Stereo Matching
Applications such as robot navigation and augmented reality require high-accuracy dense disparity maps in real-time and online. Due to time constraint, most realtime stereo applic...
Liang Wang, Mingwei Gong, Minglun Gong, Ruigang Ya...
CHI
2004
ACM
14 years 10 months ago
How to trust robots further than we can throw them
Panelists with backgrounds in diverse aspects of humanrobot interaction will discuss the challenges of human-robot interaction in terms of operator trust. The panel will showcase ...
David J. Bruemmer, Douglas A. Few, Michael A. Good...