6365 search results - page 1020 / 1273 » Fast Local Computation Algorithms |
185
click to vote
CCS
2003
ACM
15 years 12 months ago
2003
ACM
After the Code Red incident in 2001 and the SQL Slammer in January 2003, it is clear that a simple self-propagating worm can quickly spread across the Internet, infects most vulne...
173
click to vote
CVRMED
1997
Springer
15 years 11 months ago
1997
Springer
We have initiated studies towards the design and implementation of an ophthalmic augmented reality environment in order to allow for a more precise laser treatment for ophthalmic...
197
click to vote
EGH
2010
Springer
15 years 4 months ago
2010
Springer
The k-D tree is a well-studied acceleration data structure for ray tracing. It is used to organize primitives in a scene to allow efficient execution of intersection operations be...
185
click to vote
SIAMCOMP
2010
15 years 5 months ago
2010
The classical direct product theorem for circuits says that if a Boolean function f : {0, 1}n → {0, 1} is somewhat hard to compute on average by small circuits, then the correspo...
183
click to vote
IPPS
2006
IEEE
16 years 22 days ago
2006
IEEE
— Broadcasting is a data communication task in which one processor sends the same message to all other processors. Routing is a task where a source processor sends a message to a...