Sciweavers

2370 search results - page 16 / 474
» A Structured Set of Higher-Order Problems
Sort
View
CDC
2008
IEEE
104views Control Systems» more  CDC 2008»
14 years 3 months ago
A structured multiarmed bandit problem and the greedy policy
—We consider a multiarmed bandit problem where the expected reward of each arm is a linear function of an unknown scalar with a prior distribution. The objective is to choose a s...
Adam J. Mersereau, Paat Rusmevichientong, John N. ...
SIAMCOMP
1998
141views more  SIAMCOMP 1998»
13 years 8 months ago
Randomized Data Structures for the Dynamic Closest-Pair Problem
We describe a new randomized data structure, the sparse partition, for solving the dynamic closest-pair problem. Using this data structure the closest pair of a set of n points in ...
Mordecai J. Golin, Rajeev Raman, Christian Schwarz...
CSDA
2007
264views more  CSDA 2007»
13 years 8 months ago
Model-based methods to identify multiple cluster structures in a data set
Model-based clustering exploits finite mixture models for detecting group in a data set. It provides a sound statistical framework which can address some important issues, such as...
Giuliano Galimberti, Gabriele Soffritti
ICCV
2007
IEEE
14 years 10 months ago
Mixture-of-Parts Pictorial Structures for Objects with Variable Part Sets
For many multi-part object classes, the set of parts can vary not only in location but also in type. For example, player formations in American football involve various subsets of...
Robin Hess, Alan Fern, Eric N. Mortensen
DCC
2000
IEEE
14 years 1 months ago
Summary Structures for Frequency Queries on Large Transaction Sets
As large-scale databases become commonplace, there has been signi cant interest in mining them for commercial purposes. One of the basic tasks that underlies many of these mining ...
Dow-Yung Yang, Akshay Johar, Ananth Grama, Wojciec...