1702 search results - page 14 / 341 » Doomed program points |
167
click to vote
IPMI
2011
Springer
14 years 6 months ago
2011
Springer
Abstract. We introduce a novel algorithm for actin filament segmentation in 2D TIRFM image sequences. This problem is difficult because actin filaments dynamically change shapes ...
131
Voted
ICCV
2011
IEEE
14 years 2 months ago
2011
IEEE
We propose a novel method for computing a geometrically consistent and spatially dense matching between two 3D shapes. Rather than mapping points to points we match infinitesimal...
143
Voted
EC
1998
15 years 2 months ago
1998
L. M. Adleman launched the field of DNA computing with a demonstration in 1994 that strands of DNA could be used to solve the Hamiltonian path problem for a simple graph. He also...
213
Voted
MP
2011
14 years 5 months ago
2011
We present an interior-point penalty method for nonlinear programming (NLP), where the merit function consists of a piecewise linear penalty function (PLPF) and an 2-penalty functi...
135
click to vote
CRYPTO
2010
Springer
15 years 2 months ago
2010
Springer
The Virtual Black Box (VBB) property for program obfuscators provides a strong guarantee: Anything computable by an efficient adversary given the obfuscated program can also be co...