Sciweavers

1686 search results - page 136 / 338
» Programs as polygraphs: computability and complexity
Sort
View
166
Voted
TCSV
2010
14 years 10 months ago
Action Detection in Cluttered Video With Successive Convex Matching
We propose a novel successive convex matching method for human action detection in cluttered video. Human actions are represented as sequences of poses, and specific actions are de...
Hao Jiang, Mark S. Drew, Ze-Nian Li
147
Voted
ACNS
2011
Springer
231views Cryptology» more  ACNS 2011»
14 years 7 months ago
Cold Boot Key Recovery by Solving Polynomial Systems with Noise
A method for extracting cryptographic key material from DRAM used in modern computers has been recently proposed in [9]; the technique was called Cold Boot attacks. When considerin...
Martin Albrecht, Carlos Cid
JMLR
2012
13 years 6 months ago
Structured Output Learning with High Order Loss Functions
Often when modeling structured domains, it is desirable to leverage information that is not naturally expressed as simply a label. Examples include knowledge about the evaluation ...
Daniel Tarlow, Richard S. Zemel
120
Voted
ICPR
2004
IEEE
16 years 4 months ago
An Energy Minimisation Approach to Stereo-Temporal Dense Reconstruction
We propose a novel energy minimisation framework for the dense reconstruction of stereo image sequences that incorporates data fidelity as well as spatial and temporal regularity....
Ben Appleton, Brian C. Lovell, Carlos Leung, Chang...
145
Voted
ICFP
2007
ACM
16 years 3 months ago
Lazy call-by-value evaluation
Designing debugging tools for lazy functional programming languages is a complex task which is often solved by expensive tracing of lazy computations. We present a new approach in...
Bernd Braßel, Frank Huch, Germán Vida...