Sciweavers

2488 search results - page 471 / 498
» An improvement in formal verification
Sort
View
SOSP
2007
ACM
15 years 10 months ago
Attested append-only memory: making adversaries stick to their word
Researchers have made great strides in improving the fault tolerance of both centralized and replicated systems against arbitrary (Byzantine) faults. However, there are hard limit...
Byung-Gon Chun, Petros Maniatis, Scott Shenker, Jo...
ICTAC
2010
Springer
14 years 11 months ago
Preference and Non-deterministic Choice
Material Flow Abstraction of Manufacturing Systems. ‣Umberto Costa, Ivan de Medeiros Jr and Marcel Oliveira. Specification and Verification of a MPI Implementation for a MP-SoC...
Bill Stoddart, Frank Zeyda, Steve Dunne
CORR
2007
Springer
126views Education» more  CORR 2007»
15 years 1 months ago
Dial a Ride from k-forest
The k-forest problem is a common generalization of both the k-MST and the dense-k-subgraph problems. Formally, given a metric space on n vertices V , with m demand pairs ⊆ V × ...
Anupam Gupta, MohammadTaghi Hajiaghayi, Viswanath ...
ICDE
2007
IEEE
99views Database» more  ICDE 2007»
16 years 2 months ago
Source-aware Entity Matching: A Compositional Approach
Entity matching (a.k.a. record linkage) plays a crucial role in integrating multiple data sources, and numerous matching solutions have been developed. However, the solutions have...
Warren Shen, Pedro DeRose, Long Vu, AnHai Doan, Ra...
ICDE
1998
IEEE
108views Database» more  ICDE 1998»
16 years 2 months ago
Efficient Discovery of Functional and Approximate Dependencies Using Partitions
Discovery of functionaldependencies from relations has been identified as an important database analysis technique. In this paper, we present a new approach for finding functional...
Ykä Huhtala, Juha Kärkkäinen, Pasi ...