412 search results - page 60 / 83 » Algorithmic Complexity Bounds on Future Prediction Errors |
169
click to vote
IPPS
2010
IEEE
15 years 1 months ago
2010
IEEE
Abstract--Ensuring the correctness of complex implementations of software transactional memory (STM) is a daunting task. Attempts have been made to formally verify STMs, but these ...
153
click to vote
WINE
2007
Springer
15 years 10 months ago
2007
Springer
Internet search companies sell advertisement slots based on users’ search queries via an auction. Advertisers have to solve a complex optimization problem of how to place bids o...
187
click to vote
ICALP
2001
Springer
15 years 9 months ago
2001
Springer
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
152
click to vote
ICMCS
2007
IEEE
15 years 10 months ago
2007
IEEE
A novel macroblock layer rate control algorithm for H.264/ AVC is proposed in this paper. To solve the issues of rate control model in H.264/AVC, we presented a new coding complex...
173
click to vote
AAAI
2011
14 years 4 months ago
2011
Coarse-to-fine approaches use sequences of increasingly fine approximations to control the complexity of inference and learning. These techniques are often used in NLP and visio...