Sciweavers

287 search results - page 40 / 58
» Optimization Techniques for Queries with Expensive Methods
Sort
View
96
Voted
DATE
2005
IEEE
135views Hardware» more  DATE 2005»
15 years 6 months ago
Compositional Memory Systems for Multimedia Communicating Tasks
Conventional cache models are not suited for real-time parallel processing because tasks may flush each other’s data out of the cache in an unpredictable manner. In this way th...
Anca Mariana Molnos, Marc J. M. Heijligers, Sorin ...
121
Voted
STOC
2007
ACM
98views Algorithms» more  STOC 2007»
16 years 23 days ago
Negative weights make adversaries stronger
The quantum adversary method is one of the most successful techniques for proving lower bounds on quantum query complexity. It gives optimal lower bounds for many problems, has ap...
Peter Høyer, Troy Lee, Robert Spalek
88
Voted
AAAI
2008
15 years 2 months ago
Adaptive Importance Sampling with Automatic Model Selection in Value Function Approximation
Off-policy reinforcement learning is aimed at efficiently reusing data samples gathered in the past, which is an essential problem for physically grounded AI as experiments are us...
Hirotaka Hachiya, Takayuki Akiyama, Masashi Sugiya...
CVPR
2010
IEEE
15 years 8 months ago
Fast Globally Optimal 2D Human Detection with Loopy Graph Models
This paper presents an algorithm for recovering the globally optimal 2D human figure detection using a loopy graph model. This is computationally challenging because the time comp...
Tai-Peng Tian, Stan Sclaroff
201
Voted
SIGMOD
2007
ACM
120views Database» more  SIGMOD 2007»
16 years 18 days ago
Xpath on steroids: exploiting relational engines for xpath performance
A lot of research has been conducted by the database community on methods and techniques for efficient XPath processing, with great success. Despite the progress made, significant...
Haris Georgiadis, Vasilis Vassalos