Sciweavers

1658 search results - page 300 / 332
» Learning Unknown Graphs
Sort
View
CORR
2004
Springer
103views Education» more  CORR 2004»
13 years 8 months ago
Online convex optimization in the bandit setting: gradient descent without a gradient
We study a general online convex optimization problem. We have a convex set S and an unknown sequence of cost functions c1, c2, . . . , and in each period, we choose a feasible po...
Abraham Flaxman, Adam Tauman Kalai, H. Brendan McM...
IJON
1998
172views more  IJON 1998»
13 years 7 months ago
Blind separation of convolved mixtures in the frequency domain
In this paper we employ information theoretic algorithms, previously used for separating instantaneous mixtures of sources, for separating convolved mixtures in the frequency doma...
Paris Smaragdis
TSE
2002
157views more  TSE 2002»
13 years 7 months ago
Assessing the Applicability of Fault-Proneness Models Across Object-Oriented Software Projects
A number of papers have investigated the relationships between design metrics and the detection of faults in object-oriented software. Several of these studies have shown that suc...
Lionel C. Briand, Walcélio L. Melo, Jü...
ICRA
2010
IEEE
178views Robotics» more  ICRA 2010»
13 years 6 months ago
Autonomous operation of novel elevators for robot navigation
— Although robot navigation in indoor environments has achieved great success, robots are unable to fully navigate these spaces without the ability to operate elevators, includin...
Ellen Klingbeil, Blake Carpenter, Olga Russakovsky...
TIT
2008
105views more  TIT 2008»
13 years 6 months ago
State Discrimination With Post-Measurement Information
We introduce a new state discrimination problem in which we are given additional information about the state after the measurement, or more generally, after a quantum memory bound ...
Manuel A. Ballester, Stephanie Wehner, Andreas Win...