Sciweavers

137 search results - page 22 / 28
» Quantum algorithms for some hidden shift problems
Sort
View
ALT
2007
Springer
14 years 4 months ago
Learning and Verifying Graphs Using Queries with a Focus on Edge Counting
We consider the problem of learning and verifying hidden graphs and their properties given query access to the graphs. We analyze various queries (edge detection, edge counting, sh...
Lev Reyzin, Nikhil Srivastava
AAAI
2007
13 years 10 months ago
On the Partial Observability of Temporal Uncertainty
We explore a means to both model and reason about partial observability within the scope of constraintbased temporal reasoning. Prior studies of uncertainty in Temporal CSPs have ...
Michael D. Moffitt
ICTAI
2010
IEEE
13 years 5 months ago
A Closer Look at MOMDPs
Abstract--The difficulties encountered in sequential decisionmaking problems under uncertainty are often linked to the large size of the state space. Exploiting the structure of th...
Mauricio Araya-López, Vincent Thomas, Olivi...
ICCV
2011
IEEE
12 years 7 months ago
N-best maximal decoders for part models
We describe a method for generating N-best configurations from part-based models, ensuring that they do not overlap according to some user-provided definition of overlap. We ext...
Dennis Park, Deva Ramanan
GECCO
2003
Springer
153views Optimization» more  GECCO 2003»
14 years 25 days ago
SEPA: Structure Evolution and Parameter Adaptation in Feed-Forward Neural Networks
Abstract. In developing algorithms that dynamically changes the structure and weights of ANN (Artificial Neural Networks), there must be a proper balance between network complexit...
Paulito P. Palmes, Taichi Hayasaka, Shiro Usui