Sciweavers

1222 search results - page 217 / 245
» Some Results on Directable Automata
Sort
View
83
Voted
ICFP
2004
ACM
15 years 9 months ago
A sound (and complete) model of contracts
Even in statically typed languages it is useful to have certain invariants checked dynamically. Findler and Felleisen gave an algorithm for dynamically checking expressive higher-...
Matthias Blume, David A. McAllester
93
Voted
POPL
2010
ACM
15 years 7 months ago
Contracts Made Manifest
Since Findler and Felleisen [2002] introduced higher-order contracts, many variants have been proposed. Broadly, these fall into two groups: some follow Findler and Felleisen in u...
Benjamin C. Pierce, Michael Greenberg, Stephanie W...
67
Voted
SOSP
2001
ACM
15 years 6 months ago
Resilient Overlay Networks
A Resilient Overlay Network (RON) is an architecture that allows distributed Internet applications to detect and recover from path outages and periods of degraded performance with...
David G. Andersen, Hari Balakrishnan, M. Frans Kaa...
CVPR
2010
IEEE
15 years 6 months ago
Improving State-of-the-Art OCR through High-Precision Document-Specific Modeling
Optical character recognition (OCR) remains a difficult problem for noisy documents or documents not scanned at high resolution. Many current approaches rely on stored font models...
Andrew Kae, Gary Huang, Erik Learned-miller, Carl ...
LATIN
2010
Springer
15 years 4 months ago
Sharp Separation and Applications to Exact and Parameterized Algorithms
Many divide-and-conquer algorithms employ the fact that the vertex set of a graph of bounded treewidth can be separated in two roughly balanced subsets by removing a small subset o...
Fedor V. Fomin, Daniel Lokshtanov, Fabrizio Grando...