Sciweavers

193 search results - page 31 / 39
» Members of Random Closed Sets
Sort
View
APPROX
2010
Springer
139views Algorithms» more  APPROX 2010»
13 years 11 months ago
Two-Source Extractors Secure against Quantum Adversaries
We initiate the study of multi-source extractors in the quantum world. In this setting, our goal is to extract random bits from two independent weak random sources, on which two q...
Roy Kasher, Julia Kempe
CORR
2011
Springer
189views Education» more  CORR 2011»
13 years 1 months ago
Metastability of Logit Dynamics for Coordination Games
Logit Dynamics [Blume, Games and Economic Behavior, 1993] is a randomized best response dynamics for strategic games: at every time step a player is selected uniformly at random a...
Vincenzo Auletta, Diodato Ferraioli, Francesco Pas...
ATAL
2009
Springer
14 years 4 months ago
Context-aware multi-stage routing
In context-aware route planning, a set of agents has to plan routes on a common infrastructure and each agent has to plan a conflict-free route from a source to a destination wit...
Adriaan ter Mors, Jeroen van Belle, Cees Witteveen
STOC
2009
ACM
271views Algorithms» more  STOC 2009»
14 years 10 months ago
A fast and efficient algorithm for low-rank approximation of a matrix
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
Nam H. Nguyen, Thong T. Do, Trac D. Tran
COLT
2007
Springer
14 years 4 months ago
Resource-Bounded Information Gathering for Correlation Clustering
We present a new class of problems, called resource-bounded information gathering for correlation clustering. Our goal is to perform correlation clustering under circumstances in w...
Pallika Kanani, Andrew McCallum