Sciweavers

2430 search results - page 247 / 486
» Computing Tutte Polynomials
Sort
View
NMR
2004
Springer
15 years 9 months ago
On acyclic and head-cycle free nested logic programs
We define the class of head-cycle free nested logic programs, and its proper subclass of acyclic nested programs, generalising similar classes originally defined for disjunctive...
Thomas Linke, Hans Tompits, Stefan Woltran
SIGECOM
2003
ACM
134views ECommerce» more  SIGECOM 2003»
15 years 9 months ago
Correlated equilibria in graphical games
We examine correlated equilibria in the recently introduced formalism of graphical games, a succinct representation for multiplayer games. We establish a natural and powerful rela...
Sham Kakade, Michael J. Kearns, John Langford, Lui...
ASP
2003
Springer
15 years 9 months ago
Outlier Detection Using Default Logic
Default logic is used to describe regular behavior and normal properties. We suggest to exploit the framework of default logic for detecting outliers - individuals who behave in a...
Fabrizio Angiulli, Rachel Ben-Eliyahu-Zohary, Luig...
EUROCRYPT
1999
Springer
15 years 8 months ago
Proving in Zero-Knowledge that a Number Is the Product of Two Safe Primes
Abstract. We present the first efficient statistical zero-knowledge protocols to prove statements such as: – A committed number is a prime. – A committed (or revealed) number ...
Jan Camenisch, Markus Michels
121
Voted
SWAT
1998
Springer
108views Algorithms» more  SWAT 1998»
15 years 8 months ago
Formal Language Constrained Path Problems
Given an alphabet , a (directed) graph G whose edges are weighted and -labeled, and a formal language L , the formal-language-constrained shortest/simple path problem consists of ...
Christopher L. Barrett, Riko Jacob, Madhav V. Mara...