Sciweavers

1576 search results - page 66 / 316
» Properties of Synthetic Optimization Problems
Sort
View
ICIP
2010
IEEE
13 years 8 months ago
Disparity and normal estimation through alternating maximization
In this paper, we propose an algorithm that recovers binocular disparities in accordance with the surface properties of the scene under consideration. To do so, we estimate the di...
Ramya Narasimha, Elise Arnaud, Florence Forbes, Ra...
TIT
2008
110views more  TIT 2008»
13 years 10 months ago
Optimal Cross-Layer Scheduling of Transmissions Over a Fading Multiaccess Channel
We consider the problem of several users transmitting packets to a base station, and study an optimal scheduling formulation involving three communication layers, namely, the mediu...
Munish Goyal, Anurag Kumar, Vinod Sharma
CORR
2010
Springer
146views Education» more  CORR 2010»
13 years 10 months ago
Adaptive Submodularity: A New Approach to Active Learning and Stochastic Optimization
Solving stochastic optimization problems under partial observability, where one needs to adaptively make decisions with uncertain outcomes, is a fundamental but notoriously diffic...
Daniel Golovin, Andreas Krause
MICS
2010
124views more  MICS 2010»
13 years 4 months ago
An Optimal Algorithm for the k-Fixed-Endpoint Path Cover on Proper Interval Graphs
In this paper we consider the k-fixed-endpoint path cover problem on proper interval graphs, which is a generalization of the path cover problem. Given a graph G and a set T of k v...
George B. Mertzios, Walter Unger
AAAI
2010
13 years 11 months ago
Understanding the Success of Perfect Information Monte Carlo Sampling in Game Tree Search
Perfect Information Monte Carlo (PIMC) search is a practical technique for playing imperfect information games that are too large to be optimally solved. Although PIMC search has ...
Jeffrey Richard Long, Nathan R. Sturtevant, Michae...