5316 search results - page 156 / 1064 » Which Search Problems Are Random |
138
Voted
CDC
2010
IEEE
14 years 10 months ago
2010
IEEE
Abstract-- Recovering or estimating the initial state of a highdimensional system can require a potentially large number of measurements. In this paper, we explain how this burden ...
123
Voted
ICALP
2007
Springer
15 years 9 months ago
2007
Springer
We present lower bounds on the space required to estimate the quantiles of a stream of numerical values. Quantile estimation is perhaps the most studied problem in the data stream ...
199
Voted
CVPR
2012
IEEE
13 years 6 months ago
2012
IEEE
We recast the Cosegmentation problem using Random Walker (RW) segmentation as the core segmentation algorithm, rather than the traditional MRF approach adopted in the literature s...
125
Voted
ICCS
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. This paper describes metaheuristic algorithm based on simulated annealing method,which is a nature-inspired method, to analyze and improve the efficiency of the design of...
117
Voted
SIAMJO
2008
15 years 3 months ago
2008
This paper describes a Parallel Space Decomposition (PSD) technique for the Mesh Adaptive Direct Search (MADS) algorithm. MADS extends Generalized Pattern Search for constrained n...