2434 search results - page 434 / 487 » Algorithmic Randomness of Closed Sets |
179
click to vote
JMLR
2012
13 years 5 months ago
2012
We prove logarithmic regret bounds that depend on the loss L∗ T of the competitor rather than on the number T of time steps. In the general online convex optimization setting, o...
145
click to vote
JMLR
2012
13 years 5 months ago
2012
Variable selection is an important and practical problem that arises in analysis of many high-dimensional datasets. Convex optimization procedures that arise from relaxing the NP-...
265
click to vote
TOG
2012
13 years 5 months ago
2012
Capturing human activities that involve both gross full-body motion and detailed hand manipulation of objects is challenging for standard motion capture systems. We introduce a ne...
107
click to vote
KDD
2003
ACM
16 years 3 months ago
2003
ACM
Data mining techniques are routinely used by fundraisers to select those prospects from a large pool of candidates who are most likely to make a financial contribution. These tech...
122
click to vote
SOFSEM
2009
Springer
16 years 5 days ago
2009
Springer
Cuckoo hashing was introduced by Pagh and Rodler in 2001 [12]. A set S of n keys is stored in two tables T1 and T2 each of which has m cells of capacity 1 such that constant access...