Sciweavers

1047 search results - page 126 / 210
» Searching Without a Heuristic: Efficient Use of Abstraction
Sort
View
ECCV
2004
Springer
14 years 10 months ago
Recognition by Probabilistic Hypothesis Construction
We present a probabilistic framework for recognizing objects in images of cluttered scenes. Hundreds of objects may be considered and searched in parallel. Each object is learned f...
Pierre Moreels, Michael Maire, Pietro Perona
ATAL
2010
Springer
13 years 8 months ago
PAC-MDP learning with knowledge-based admissible models
PAC-MDP algorithms approach the exploration-exploitation problem of reinforcement learning agents in an effective way which guarantees that with high probability, the algorithm pe...
Marek Grzes, Daniel Kudenko
PKC
2009
Springer
210views Cryptology» more  PKC 2009»
14 years 8 months ago
Controlling Access to an Oblivious Database Using Stateful Anonymous Credentials
In this work, we consider the task of allowing a content provider to enforce complex access control policies on oblivious protocols conducted with anonymous users. As our primary ...
Scott E. Coull, Matthew Green, Susan Hohenberger
GECCO
2008
Springer
186views Optimization» more  GECCO 2008»
13 years 9 months ago
A pareto following variation operator for fast-converging multiobjective evolutionary algorithms
One of the major difficulties when applying Multiobjective Evolutionary Algorithms (MOEA) to real world problems is the large number of objective function evaluations. Approximate...
A. K. M. Khaled Ahsan Talukder, Michael Kirley, Ra...
WWW
2008
ACM
14 years 8 months ago
Budget constrained bidding in keyword auctions and online knapsack problems
We consider the budget-constrained bidding optimization problem for sponsored search auctions, and model it as an online (multiple-choice) knapsack problem. We design both determi...
Yunhong Zhou, Deeparnab Chakrabarty, Rajan M. Luko...