Sciweavers

36781 search results - page 309 / 7357
» Parameterizing by the Number of Numbers
Sort
View
CADE
2006
Springer
16 years 6 months ago
Inferring Network Invariants Automatically
Abstract. Verification by network invariants is a heuristic to solve uniform verification of parameterized systems. Given a system P, a network invariant for P is that abstracts th...
Olga Grinchtein, Martin Leucker, Nir Piterman
SIGMOD
2006
ACM
153views Database» more  SIGMOD 2006»
16 years 6 months ago
Interactive query formulation over web service-accessed sources
Integration systems typically support only a restricted set of queries over the schema they export. The reason is that the participating information sources contribute limited con...
Michalis Petropoulos, Alin Deutsch, Yannis Papakon...
SIGMOD
2002
ACM
134views Database» more  SIGMOD 2002»
16 years 6 months ago
QURSED: querying and reporting semistructured data
QURSED enables the development of web-based query forms and reports (QFRs) that query and report semistructured XML data, i.e., data that are characterized by nesting, irregularit...
Yannis Papakonstantinou, Michalis Petropoulos, Vas...
ESOP
2010
Springer
16 years 3 months ago
Faulty Logic: Reasoning about Fault Tolerant Programs
Transient faults are single-shot hardware errors caused by high energy particles from space, manufacturing defects, overheating, and other sources. Such faults can be devastating f...
Matthew L. Meola and David Walker
ALT
2004
Springer
16 years 3 months ago
Relative Loss Bounds and Polynomial-Time Predictions for the k-lms-net Algorithm
We consider a two-layer network algorithm. The first layer consists of an uncountable number of linear units. Each linear unit is an LMS algorithm whose inputs are first “kerne...
Mark Herbster