Sciweavers

11910 search results - page 2319 / 2382
» Online Learning Algorithms
Sort
View
COCO
2006
Springer
96views Algorithms» more  COCO 2006»
14 years 18 days ago
Optimal Hardness Results for Maximizing Agreements with Monomials
We consider the problem of finding a monomial (or a term) that maximizes the agreement rate with a given set of examples over the Boolean hypercube. The problem is motivated by le...
Vitaly Feldman
FUN
2010
Springer
230views Algorithms» more  FUN 2010»
14 years 5 days ago
Scheduling with Bully Selfish Jobs
In job scheduling with precedence constraints, i j means that job j cannot start being processed before job i is completed. In this paper we consider selfish bully jobs who do no...
Tami Tamir
GLOBECOM
2009
IEEE
14 years 3 days ago
Conjectural Equilibrium in Water-Filling Games
—This paper considers a non-cooperative game in which competing users sharing a frequency-selective interference channel selfishly optimize their power allocation in order to imp...
Yi Su, Mihaela van der Schaar
ATAL
2008
Springer
13 years 11 months ago
Adaptive Kanerva-based function approximation for multi-agent systems
In this paper, we show how adaptive prototype optimization can be used to improve the performance of function approximation based on Kanerva Coding when solving largescale instanc...
Cheng Wu, Waleed Meleis
ACCV
2007
Springer
13 years 10 months ago
A Convex Programming Approach to the Trace Quotient Problem
Abstract. The trace quotient problem arises in many applications in pattern classification and computer vision, e.g., manifold learning, low-dimension embedding, etc. The task is ...
Chunhua Shen, Hongdong Li, Michael J. Brooks
« Prev « First page 2319 / 2382 Last » Next »