Sciweavers

4131 search results - page 108 / 827
» The Generalized Max-Controlled Set Problem
Sort
View
FOCS
2008
IEEE
15 years 9 months ago
Kakeya Sets, New Mergers and Old Extractors
A merger is a probabilistic procedure which extracts the randomness out of any (arbitrarily correlated) set of random variables, as long as one of them is uniform. Our main result...
Zeev Dvir, Avi Wigderson
CVPR
2010
IEEE
15 years 11 months ago
Optimizing One-Shot Recognition with Micro-Set Learning
For object category recognition to scale beyond a small number of classes, it is important that algorithms be able to learn from a small amount of labeled data per additional clas...
Kevin Tang, Marshall Tappen, Rahul Sukthankar, Chr...
CORR
2007
Springer
183views Education» more  CORR 2007»
15 years 3 months ago
A complete set of rotationally and translationally invariant features for images
We propose a new set of rotationally and translationally invariant features for image or pattern recognition and classification. The new features are cubic polynomials in the pix...
Risi Imre Kondor
GECCO
2007
Springer
136views Optimization» more  GECCO 2007»
15 years 7 months ago
Configuring an evolutionary tool for the inventory and transportation problem
EVITA, standing for Evolutionary Inventory and Transportation Algorithm, aims to be a commercial tool to address the problem of minimising both the transport and inventory costs o...
Anna Esparcia-Alcázar, Lidia Lluch-Revert, ...
108
Voted
CDC
2008
IEEE
104views Control Systems» more  CDC 2008»
15 years 9 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. ...