Sciweavers

5084 search results - page 261 / 1017
» Proving Possibility Properties
Sort
View
FOCS
2002
IEEE
15 years 11 months ago
Learning a Hidden Matching
We consider the problem of learning a matching (i.e., a graph in which all vertices have degree 0 or 1) in a model where the only allowed operation is to query whether a set of ve...
Noga Alon, Richard Beigel, Simon Kasif, Steven Rud...
CRYPTO
2000
Springer
145views Cryptology» more  CRYPTO 2000»
15 years 11 months ago
Nonlinearity Bounds and Constructions of Resilient Boolean Functions
In this paper we investigate the relationship between the nonlinearity and the order of resiliency of a Boolean function. We first prove a sharper version of McEliece theorem for ...
Palash Sarkar, Subhamoy Maitra
ILP
1999
Springer
15 years 11 months ago
Morphosyntactic Tagging of Slovene Using Progol
Abstract. We consider the task of tagging Slovene words with morphosyntactic descriptions (MSDs). MSDs contain not only part-of-speech information but also attributes such as gende...
James Cussens, Saso Dzeroski, Tomaz Erjavec
WDAG
1992
Springer
104views Algorithms» more  WDAG 1992»
15 years 10 months ago
Choice Coordination with Multiple Alternatives (Preliminary Version)
Abstract. The Choice Coordination Problem with k alternatives (kCCP) was introduced by Rabin in 1982 [Rab82]. The goal is to design a wait-free protocol for n asynchronous processe...
David S. Greenberg, Gadi Taubenfeld, Da-Wei Wang
ATAL
2007
Springer
15 years 10 months ago
A unified and general framework for argumentation-based negotiation
This paper proposes a unified and general framework for argumentation-based negotiation, in which the role of argumentation is formally analyzed. The framework makes it possible t...
Leila Amgoud, Yannis Dimopoulos, Pavlos Moraitis