21324 search results - page 101 / 4265 » Making the case for computing |
ECCV
2010
Springer
14 years 3 months ago
2010
Springer
Most state-of-the-art approaches to action recognition rely on global representations either by concatenating local information in a long descriptor vector or by computing a single...
COMPGEOM
2010
ACM
14 years 3 months ago
2010
ACM
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea ...
ACMIDC
2008
14 years 5 days ago
2008
In this paper we describe the design and initial evaluation of a tangible computer programming exhibit for children on display at the Boston Museum of Science. We also discuss fiv...
CONCUR
2012
Springer
12 years 17 days ago
2012
Springer
Simulation and Abstraction Guy Avni and Orna Kupferman School of Computer Science and Engineering, Hebrew University, Israel Weighted automata map input words to real numbers and a...
NDSS
2009
IEEE
14 years 4 months ago
2009
IEEE
We describe CSAR, a novel technique for generating cryptographically strong, accountable randomness. Using CSAR, we can generate a pseudo-random sequence and a proof that the elem...