Sciweavers

MFCS
2010
Springer
13 years 2 months ago
Parity Games with Partial Information Played on Graphs of Bounded Complexity
Abstract. We address the strategy problem for parity games with partial information and observable colors, played on finite graphs of bounded graph complexity. We consider several...
Bernd Puchala, Roman Rabinovich
DAISD
1994
104views more  DAISD 1994»
13 years 5 months ago
Validating Constraints with Partial Information: Research Overview
We are interested in the problem of validating the consistency of integrity constraints when data is modi ed. In particular, we consider how constraints can be checked with only p...
Jennifer Widom, Ashish Gupta, Yehoshua Sagiv, Jeff...
AAAI
1998
13 years 5 months ago
Abductive Planning with Sensing
In abductive planning, plans are constructed as reasons for an agent to act: plans are demonstrations in logical theory of action that a goal will result assuming that given actio...
Matthew Stone
SDB
1995
178views Database» more  SDB 1995»
13 years 7 months ago
A Semantics-based Approach to Design of Query Languages for Partial Information
Most of work on partial information in databases asks which operations of standard languages, like relational algebra, can still be performed correctly in the presence of nulls. In...
Leonid Libkin
PODC
2010
ACM
13 years 7 months ago
Partial information spreading with application to distributed maximum coverage
This paper addresses partial information spreading among n nodes of a network. As opposed to traditional information spreading, where each node has a message that must be received...
Keren Censor Hillel, Hadas Shachnai
EUROCRYPT
2001
Springer
13 years 8 months ago
Key Recovery and Message Attacks on NTRU-Composite
NTRU is a fast public key cryptosystem presented in 1996 by Hoffstein, Pipher and Silverman of Brown University. It operates in the ring of polynomials Z[X]/(XN − 1), where the ...
Craig Gentry
INFOCOM
2002
IEEE
13 years 8 months ago
Distributed Partial Information Management (DPIM) Schemes for Survivable Networks - Part I
—This paper describes a novel framework, called Distributed Partial Information Management (or DPIM). It addresses several major challenges in achieving efficient shared path pr...
Chunming Qiao, Dahai Xu
CHES
2004
Springer
136views Cryptology» more  CHES 2004»
13 years 9 months ago
Attacking DSA Under a Repeated Bits Assumption
We discuss how to recover the private key for DSA style signature schemes if partial information about the ephemeral keys is revealed. The partial information we examine is of a se...
Peter J. Leadbitter, Dan Page, Nigel P. Smart
TBILLC
2005
Springer
13 years 9 months ago
Real World Multi-agent Systems: Information Sharing, Coordination and Planning
Abstract. Applying multi-agent systems in real world scenarios requires several essential research questions to be answered. Agents have to perceive their environment in order to t...
Frans C. A. Groen, Matthijs T. J. Spaan, Jelle R. ...
ISIPTA
2005
IEEE
146views Mathematics» more  ISIPTA 2005»
13 years 9 months ago
Arithmetic on Random Variables: Squeezing the Envelopes with New Joint Distribution Constraints
Uncertainty is a key issue in decision analysis and other kinds of applications. Researchers have developed a number of approaches to address computations on uncertain quantities....
Jianzhong Zhang 0004, Daniel Berleant