Sciweavers

2084 search results - page 379 / 417
» Proving Time Bounds for Randomized Distributed Algorithms
Sort
View
COCO
2004
Springer
185views Algorithms» more  COCO 2004»
15 years 1 months ago
Limitations of Quantum Advice and One-Way Communication
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
Scott Aaronson
ICPADS
2007
IEEE
15 years 4 months ago
Loop recreation for thread-level speculation
For some sequential loops, existing techniques that form speculative threads only at their loop boundaries do not adequately expose the speculative parallelism inherent in them. T...
Lin Gao 0002, Lian Li 0002, Jingling Xue, Tin-Fook...
SIGECOM
2011
ACM
320views ECommerce» more  SIGECOM 2011»
14 years 15 days ago
Market making and mean reversion
Market making refers broadly to trading strategies that seek to profit by providing liquidity to other traders, while avoiding accumulating a large net position in a stock. In th...
Tanmoy Chakraborty, Michael Kearns
SPAA
2003
ACM
15 years 2 months ago
A proportionate fair scheduling rule with good worst-case performance
In this paper we consider the following scenario. A set of n jobs with different threads is being run concurrently. Each job has an associated weight, which gives the proportion ...
Micah Adler, Petra Berenbrink, Tom Friedetzky, Les...
121
Voted
CVPR
2010
IEEE
1639views Computer Vision» more  CVPR 2010»
15 years 5 months ago
Multi-Target Tracking of Time-varying Spatial Patterns
Time-varying spatial patterns are common, but few computational tools exist for discovering and tracking multiple, sometimes overlapping, spatial structures of targets. We propose...
Jingchen Liu, Yanxi Liu