Sciweavers

19798 search results - page 3647 / 3960
» Is Structural Subtyping Useful
Sort
View
POPL
2010
ACM
16 years 2 months ago
Dependent Types from Counterexamples
d by recent research in abstract model checking, we present a new approach to inferring dependent types. Unlike many of the existing approaches, our approach does not rely on prog...
Tachio Terauchi
POPL
2010
ACM
16 years 2 months ago
Counterexample-Guided Focus
The automated inference of quantified invariants is considered one of the next challenges in software verification. The question of the right precision-efficiency tradeoff for the...
Andreas Podelski, Thomas Wies
POPL
2010
ACM
16 years 2 months ago
Higher-Order Multi-Parameter Tree Transducers and Recursion Schemes for Program Verification
We introduce higher-order, multi-parameter, tree transducers (HMTTs, for short), which are kinds of higher-order tree transducers that take input trees and output a (possibly infi...
Naoki Kobayashi, Naoshi Tabuchi, Hiroshi Unno
SODA
2010
ACM
704views Algorithms» more  SODA 2010»
16 years 2 months ago
A locality-sensitive hash for real vectors
We present a simple and practical algorithm for the c-approximate near neighbor problem (c-NN): given n points P Rd and radius R, build a data structure which, given q Rd , can ...
Tyler Neylon
SODA
2010
ACM
177views Algorithms» more  SODA 2010»
16 years 2 months ago
Convergence, Stability, and Discrete Approximation of Laplace Spectra
Spectral methods have been widely used in a broad range of application fields. One important object involved in such methods is the Laplace-Beltrami operator of a manifold. Indeed...
Tamal K. Dey, Pawas Ranjan, Yusu Wang
« Prev « First page 3647 / 3960 Last » Next »