Sciweavers

2092 search results - page 408 / 419
» A Theory of Non-Deterministic Networks
Sort
View
SIGECOM
2003
ACM
122views ECommerce» more  SIGECOM 2003»
14 years 3 months ago
On polynomial-time preference elicitation with value queries
Preference elicitation — the process of asking queries to determine parties’ preferences — is a key part of many problems in electronic commerce. For example, a shopping age...
Martin Zinkevich, Avrim Blum, Tuomas Sandholm
DIGRA
2003
Springer
14 years 3 months ago
Supporting visual elements of non-verbal communication in computer game avatars
Communication between players in networked computer games is often inadequately implemented. The games do not exploit the full potential of using different forms of communication ...
Tomi Kujanpää, Tony Manninen
EUROCRYPT
2003
Springer
14 years 3 months ago
Facts and Myths of Enigma: Breaking Stereotypes
In spite of a relatively large number of publications about breaking Enigma by the Allies before and during the World War II, this subject remains relatively unknown not only to th...
Kris Gaj, Arkadiusz Orlowski
PODS
2010
ACM
215views Database» more  PODS 2010»
14 years 2 months ago
An optimal algorithm for the distinct elements problem
We give the first optimal algorithm for estimating the number of distinct elements in a data stream, closing a long line of theoretical research on this problem begun by Flajolet...
Daniel M. Kane, Jelani Nelson, David P. Woodruff
CDC
2009
IEEE
151views Control Systems» more  CDC 2009»
14 years 2 months ago
A poset framework to model decentralized control problems
— In this paper we use partially ordered sets (posets) to study decentralized control problems arising in different settings. We show that time delayed systems with certain dela...
Parikshit Shah, Pablo A. Parrilo