Sciweavers

60 search results - page 11 / 12
» From Computing Sets of Optima, Pareto Sets, and Sets of Nash...
Sort
View
CORR
2008
Springer
107views Education» more  CORR 2008»
13 years 7 months ago
A Spectral Algorithm for Learning Hidden Markov Models
Hidden Markov Models (HMMs) are one of the most fundamental and widely used statistical tools for modeling discrete time series. In general, learning HMMs from data is computation...
Daniel Hsu, Sham M. Kakade, Tong Zhang
PODS
2008
ACM
178views Database» more  PODS 2008»
14 years 7 months ago
The chase revisited
We revisit the classical chase procedure, studying its properties as well as its applicability to standard database problems. We settle (in the negative) the open problem of decid...
Alin Deutsch, Alan Nash, Jeffrey B. Remmel
ATAL
2003
Springer
14 years 27 days ago
On optimal outcomes of negotiations over resources
We analyse scenarios in which self-interested agents negotiate with each other in order to agree on deals to exchange resources. We consider two variants of the framework, one whe...
Ulrich Endriss, Nicolas Maudet, Fariba Sadri, Fran...
CCS
2008
ACM
13 years 9 months ago
Dependent link padding algorithms for low latency anonymity systems
Low latency anonymity systems are susceptive to traffic analysis attacks. In this paper, we propose a dependent link padding scheme to protect anonymity systems from traffic analy...
Wei Wang 0002, Mehul Motani, Vikram Srinivasan
ICALP
2010
Springer
13 years 9 months ago
The Cooperative Game Theory Foundations of Network Bargaining Games
We study bargaining games between suppliers and manufacturers in a network context. Agents wish to enter into contracts in order to generate surplus which then must be divided amon...
MohammadHossein Bateni, MohammadTaghi Hajiaghayi, ...