Sciweavers

450 search results - page 48 / 90
» Estimating Search Tree Size
Sort
View
INFORMS
2000
128views more  INFORMS 2000»
13 years 8 months ago
A Revised Simplex Search Procedure for Stochastic Simulation Response Surface Optimization
We develop a variant of the Nelder-Mead (NM) simplex search procedure for stochastic simulation optimization that is designed to avoid many of the weaknesses encumbering such dire...
David G. Humphrey, James R. Wilson
PAMI
2011
13 years 3 months ago
Greedy Learning of Binary Latent Trees
—Inferring latent structures from observations helps to model and possibly also understand underlying data generating processes. A rich class of latent structures are the latent ...
Stefan Harmeling, Christopher K. I. Williams
PAMI
2010
184views more  PAMI 2010»
13 years 7 months ago
Accurate Image Search Using the Contextual Dissimilarity Measure
— This paper introduces the contextual dissimilarity measure which significantly improves the accuracy of bag-offeatures based image search. Our measure takes into account the l...
Herve Jegou, Cordelia Schmid, Hedi Harzallah, Jako...
PLDI
1995
ACM
14 years 10 days ago
APT: A Data Structure for Optimal Control Dependence Computation
The control dependence relation is used extensively in restructuring compilers. This relation is usually represented using the control dependence graph; unfortunately, the size of...
Keshav Pingali, Gianfranco Bilardi
ITNG
2006
IEEE
14 years 2 months ago
Side-Channel Leakage Tolerant Architectures
Side-channel attacks compare side-channel leakage predictions or estimations with side-channel leakage measurements. The estimations are based on the exact value of a few select s...
Kris Tiri, Patrick Schaumont, Ingrid Verbauwhede