5214 search results - page 152 / 1043 » The Online Specialization Problem |
130
click to vote
NIPS
2008
15 years 5 months ago
2008
This paper examines the generalization properties of online convex programming algorithms when the loss function is Lipschitz and strongly convex. Our main result is a sharp bound...
142
click to vote
MICCAI
2004
Springer
16 years 4 months ago
2004
Springer
We tackle the problem of real-time statistical analysis of functional magnetic resonance imaging (fMRI) data. In a recent paper, we proposed an incremental algorithm based on the e...
125
click to vote
CCCG
1993
15 years 5 months ago
1993
A k-dense corridor through a finite set, S, of n points in the plane is the open region of the plane that is bounded by two parallel lines that intersect the convex hull of S and ...
138
click to vote
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
—With the explosive deployment of “triple play” (voice, video and data services) over the same access network, guaranteeing a certain-level of survivability for the access ne...
155
click to vote
ICDT
2007
ACM
15 years 10 months ago
2007
ACM
Query containment is a fundamental problem of databases. Given two queries q1 and q2, it asks whether the set of answers to q1 is included in the set of answers to q2 for any datab...