Sciweavers

2100 search results - page 371 / 420
» Fundamentals of the problem
Sort
View
SIGECOM
2006
ACM
135views ECommerce» more  SIGECOM 2006»
14 years 3 months ago
Finding equilibria in large sequential games of imperfect information
Finding an equilibrium of an extensive form game of imperfect information is a fundamental problem in computational game theory, but current techniques do not scale to large games...
Andrew Gilpin, Tuomas Sandholm
WORDS
2005
IEEE
14 years 2 months ago
A Framework for Preparing Experimental Evaluation of Rerouting Mechanisms
Since the deployment of real-time sensitive applications in the Internet, the research community has been struggling to leverage the IP best-effort networks for providing QoS assu...
Reinaldo de Barros Correia, Luiz F. Rust da Costa ...
NIME
2005
Springer
129views Music» more  NIME 2005»
14 years 2 months ago
Network Latency Adaptive Tempo in the Public Sound Objects System
In recent years Computer Network-Music has increasingly captured the attention of the Computer Music Community. With the advent of Internet communication, geographical displacemen...
Alvaro Barbosa, Jorge Cardoso, Gunter Geiger
SPAA
2004
ACM
14 years 2 months ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter
CRYPTO
2004
Springer
120views Cryptology» more  CRYPTO 2004»
14 years 2 months ago
Round-Optimal Secure Two-Party Computation
Abstract. We consider the central cryptographic task of secure twoparty computation, where two parties wish to compute some function of their private inputs (each receiving possibl...
Jonathan Katz, Rafail Ostrovsky