3820 search results - page 268 / 764 » Bounded Model Debugging |
141
click to vote
TCS
2011
14 years 10 months ago
2011
New, simple, proofs of soundness (every representable function lies in a given complexity class) for Elementary Affine Logic, LFPL and Soft Affine Logic are presented. The proofs ...
159
click to vote
CORR
2011
Springer
14 years 7 months ago
2011
Springer
We initiate the study of sparse recovery problems under the Earth-Mover Distance (EMD). Specifically, we design a distribution over m × n matrices A such that for any x, given A...
147
click to vote
VR
1999
IEEE
15 years 8 months ago
1999
IEEE
We present a framework for fast and accurate collision detection for haptic interaction with polygonal models. Given a model, we pre-compute a hybrid hierarchical representation, ...
143
click to vote
DC
2007
2007
Booting clock synchronization in partially synchronous systems with hybrid process and link failures
15 years 3 months ago
This paper provides description and analysis of a new clock synchronization algorithm for synchronous and partially synchronous systems with unknown upper and lower bounds on delay...
116
click to vote
JSYML
2008
15 years 3 months ago
2008
In 2004 Csima, Hirschfeldt, Knight, and Soare [1] showed that a set A T 0 is nonlow2 if and only if A is prime bounding, i.e. for every complete atomic decidable theory T , there i...