Sciweavers

1578 search results - page 64 / 316
» Algorithmic randomness of continuous functions
Sort
View
COLT
2004
Springer
15 years 1 months ago
Regret Bounds for Hierarchical Classification with Linear-Threshold Functions
We study the problem of classifying data in a given taxonomy when classifications associated with multiple and/or partial paths are allowed. We introduce an incremental algorithm u...
Nicolò Cesa-Bianchi, Alex Conconi, Claudio ...
ICCV
2011
IEEE
13 years 9 months ago
Perturb-and-MAP Random Fields: Using Discrete Optimization\\to Learn and Sample from Energy Models
We propose a novel way to induce a random field from an energy function on discrete labels. It amounts to locally injecting noise to the energy potentials, followed by finding t...
George Papandreou, Alan L. Yuille
ICMCS
2005
IEEE
123views Multimedia» more  ICMCS 2005»
15 years 3 months ago
An iterative power allocation algorithm in OFDM system based on power relaxation
Abstract— We present an efficient algorithm for power allocation and bit loading in multi-user OFDM system. We starts with the close-form optimum power solution based on ideal c...
Ju Wang, Jonathan C. L. Liu
GECCO
2007
Springer
177views Optimization» more  GECCO 2007»
15 years 3 months ago
On the behavioral diversity of random programs
Generating a random sampling of program trees with specified function and terminal sets is the initial step of many program evolution systems. I present a theoretical and experim...
Moshe Looks
WG
2005
Springer
15 years 3 months ago
Approximation Algorithms for the Bi-criteria Weighted max-cut Problem
Abstract. We consider a generalization of the classical max-cut problem where two objective functions are simultaneously considered. We derive some theorems on the existence and th...
Eric Angel, Evripidis Bampis, Laurent Gourvè...