Sciweavers

608 search results - page 76 / 122
» Tests, Proofs and Refinements
Sort
View
APPROX
2005
Springer
96views Algorithms» more  APPROX 2005»
14 years 1 months ago
Tolerant Locally Testable Codes
An error-correcting code is said to be locally testable if it has an efficient spot-checking procedure that can distinguish codewords from strings that are far from every codeword...
Venkatesan Guruswami, Atri Rudra
ECOOP
2010
Springer
14 years 18 days ago
The Essence of JavaScript
We reduce JavaScript to a core calculus structured as a small-step operational semantics. We present several peculiarities of the language and show that our calculus models them. W...
Arjun Guha, Claudiu Saftoiu, Shriram Krishnamurthi
DAC
1998
ACM
14 years 8 months ago
Robust IP Watermarking Methodologies for Physical Design
Increasingly popular reuse-based design paradigms create a pressing need for authorship enforcement techniques that protect the intellectual property rights of designers. We devel...
Andrew B. Kahng, Stefanus Mantik, Igor L. Markov, ...
MICCAI
2007
Springer
14 years 8 months ago
Towards an Identification of Tumor Growth Parameters from Time Series of Images
In cancer treatment, understanding the aggressiveness of the tumor is essential in therapy planning and patient follow-up. In this article, we present a novel method for quantifyin...
Ender Konukoglu, Olivier Clatz, Pierre-Yves Bondia...
ICML
2007
IEEE
14 years 8 months ago
Exponentiated gradient algorithms for log-linear structured prediction
Conditional log-linear models are a commonly used method for structured prediction. Efficient learning of parameters in these models is therefore an important problem. This paper ...
Amir Globerson, Terry Koo, Xavier Carreras, Michae...