Sciweavers

1722 search results - page 241 / 345
» Generating Tests from Counterexamples
Sort
View
SIGSOFT
1994
ACM
14 years 1 months ago
Reengineering a Complex Application Using a Scalable Data Structure Compiler
1 P2 is a scalable compiler for collection data structures. High-level ions insulate P2 users from data structure implementation details. By specifying a target data structure as a...
Don S. Batory, Jeff Thomas, Marty Sirkin
ECCV
2010
Springer
14 years 1 months ago
Bundle Adjustment in the Large
Abstract. We present the design and implementation of a new inexact Newton type algorithm for solving large-scale bundle adjustment problems with tens of thousands of images. We ex...
CAV
2010
Springer
187views Hardware» more  CAV 2010»
14 years 1 months ago
Fences in Weak Memory Models
We present a class of relaxed memory models, defined in Coq, parameterised by the chosen permitted local reorderings of reads and writes, and the visibility of inter- and intra-pr...
Jade Alglave, Luc Maranget, Susmit Sarkar, Peter S...
EKAW
2006
Springer
14 years 23 days ago
Capturing Quantified Constraints in FOL, Through Interaction with a Relationship Graph
As new semantic web standards evolve to allow quantified rules in FOL, we need new ways to capture them from end users. We show how to do this against a graphic view of entities an...
Peter M. D. Gray, Graham J. L. Kemp
DRR
2010
13 years 11 months ago
Efficient automatic OCR word validation using word partial format derivation and language model
In this paper we present an OCR validation module, implemented for the System for Preservation of Electronic Resources (SPER) developed at the U.S. National Library of Medicine.1 ...
Siyuan Chen, Dharitri Misra, George R. Thoma