3415 search results - page 426 / 683 » Lower bounds on kernelization |
196
click to vote
NIPS
2008
15 years 8 months ago
2008
Confidence-weighted (CW) learning [6], an online learning method for linear classifiers, maintains a Gaussian distributions over weight vectors, with a covariance matrix that repr...
150
click to vote
NIPS
2007
15 years 8 months ago
2007
We study the rates of growth of the regret in online convex optimization. First, we show that a simple extension of the algorithm of Hazan et al eliminates the need for a priori k...
148
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
Let H be a finite family of graphs. A graph G is H-universal if it contains a copy of each H H as a subgraph. Let H(k, n) denote the family of graphs on n vertices with maximum d...
167
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
The Earth Mover Distance (EMD) between two equalsize sets of points in Rd is defined to be the minimum cost of a bipartite matching between the two pointsets. It is a natural metr...
167
click to vote
OPODIS
2007
15 years 8 months ago
2007
In Sensor Networks, the lack of topology information and the availability of only one communication channel has led research work to the use of randomization to deal with collisio...