Sciweavers

159 search results - page 27 / 32
» Open Problems from CCCG 2008
Sort
View
COLT
2008
Springer
13 years 9 months ago
On the Power of Membership Queries in Agnostic Learning
We study the properties of the agnostic learning framework of Haussler [Hau92] and Kearns, Schapire and Sellie [KSS94]. In particular, we address the question: is there any situat...
Vitaly Feldman
SIGMETRICS
2008
ACM
13 years 7 months ago
Long range mutual information
Network traffic modeling generally views traffic as a superposition of flows that creates a timeseries of volume counts (e.g. of bytes or packets). What is omitted from this view ...
Nahur Fonseca, Mark Crovella, Kavé Salamati...
COLT
2010
Springer
13 years 5 months ago
Learning Rotations with Little Regret
We describe online algorithms for learning a rotation from pairs of unit vectors in Rn . We show that the expected regret of our online algorithm compared to the best fixed rotati...
Elad Hazan, Satyen Kale, Manfred K. Warmuth
DM
2007
97views more  DM 2007»
13 years 7 months ago
L(p, q) labeling of d-dimensional grids
In this paper, we address the problem of λ labelings, that was introduced in the context of frequency assignment for telecommunication networks. In this model, stations within a ...
Guillaume Fertin, André Raspaud
JETAI
2008
114views more  JETAI 2008»
13 years 7 months ago
On the nature of minds, or: truth and consequences
Are minds really dynamical or are they really symbolic? Because minds are bundles of computations, and because computation is always a matter of interpretation of one system by an...
Shimon Edelman