Sciweavers

249 search results - page 38 / 50
» Analysis of Resource Lower Bounds in Real-Time Applications
Sort
View
AAAI
2012
13 years 7 hour ago
Generalized Sampling and Variance in Counterfactual Regret Minimization
In large extensive form games with imperfect information, Counterfactual Regret Minimization (CFR) is a popular, iterative algorithm for computing approximate Nash equilibria. Whi...
Richard G. Gibson, Marc Lanctot, Neil Burch, Duane...
BC
1998
111views more  BC 1998»
14 years 9 months ago
How to "hear" visual disparities: real-time stereoscopic spatial depth analysis using temporal resonance
Abstract. In a stereoscopic system, both eyes or cameras have a slightly di€erent view. As a consequence, small variations between the projected images exist (`disparities') ...
Bernd Porr, Alex Cozzi, Florentin Wörgöt...
IPPS
1999
IEEE
15 years 1 months ago
A Network Status Predictor to Support Dynamic Scheduling in Network-Based Computing Systems
The management of networks has often been ignored in network-based computing systems due to the difficulty of estimating application programs' network latency and bandwidth r...
JunSeong Kim, David J. Lilja
JCO
2007
123views more  JCO 2007»
14 years 9 months ago
On the number of local minima for the multidimensional assignment problem
The Multidimensional Assignment Problem (MAP) is an NP-hard combinatorial optimization problem occurring in many applications, such as data association, target tracking, and resou...
Don A. Grundel, Pavlo A. Krokhmal, Carlos A. S. Ol...
ECCC
2011
207views ECommerce» more  ECCC 2011»
14 years 4 months ago
Balls and Bins: Smaller Hash Families and Faster Evaluation
A fundamental fact in the analysis of randomized algorithm is that when n balls are hashed into n bins independently and uniformly at random, with high probability each bin contai...
L. Elisa Celis, Omer Reingold, Gil Segev, Udi Wied...