Sciweavers

738 search results - page 117 / 148
» Formal Methods: for All or for Chosen
Sort
View
DBPL
2007
Springer
103views Database» more  DBPL 2007»
14 years 12 days ago
Datalog Programs over Infinite Databases, Revisited
Traditionally, infinite databases were studied as a data model for queries that may contain function symbols (since functions may be expressed as infinite relations). Recently, th...
Sara Cohen, Joseph Gil, Evelina Zarivach
KDD
2010
ACM
244views Data Mining» more  KDD 2010»
14 years 10 days ago
Connecting the dots between news articles
The process of extracting useful knowledge from large datasets has become one of the most pressing problems in today’s society. The problem spans entire sectors, from scientists...
Dafna Shahaf, Carlos Guestrin
ATAL
2006
Springer
14 years 6 days ago
Temporal qualitative coalitional games
Qualitative Coalitional Games (QCGs) are a version of coalitional games in which an agent's desires are represented as goals which are either satisfied or unsatisfied, and ea...
Thomas Ågotnes, Wiebe van der Hoek, Michael ...
CRYPTO
2006
Springer
92views Cryptology» more  CRYPTO 2006»
14 years 5 days ago
Rigorous Bounds on Cryptanalytic Time/Memory Tradeoffs
In this paper we formalize a general model of cryptanalytic time/memory tradeoffs for the inversion of a random function f : {0, 1, . . . , N - 1} {0, 1, . . . , N - 1}. The model...
Elad Barkan, Eli Biham, Adi Shamir
DICS
2006
14 years 4 days ago
Algorithms for Failure Protection in Large IP-over-fiber and Wireless Ad Hoc Networks
We address failure location and restoration in both optical and wireless ad hoc networks. First, we show how Maximum Likelihood inference can improve failure location algorithms in...
Frederick Ducatelle, Luca Maria Gambardella, Macie...