234 search results - page 38 / 47 » Randomized splay trees: Theoretical and experimental results |
122
Voted
NIPS
2003
15 years 3 months ago
2003
In the problem of probability forecasting the learner’s goal is to output, given a training set and a new object, a suitable probability measure on the possible values of the ne...
108
click to vote
JMLR
2010
14 years 8 months ago
2010
L1 (also referred to as the 1-norm or Lasso) penalty based formulations have been shown to be effective in problem domains when noisy features are present. However, the L1 penalty...
142
click to vote
KDD
2009
ACM
16 years 2 months ago
2009
ACM
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
131
click to vote
INFOCOM
2010
IEEE
15 years 7 days ago
2010
IEEE
—Generating a secret key between two parties by extracting the shared randomness in the wireless fading channel is an emerging area of research. Previous works focus mainly on si...
115
click to vote
ICPR
2008
IEEE
15 years 8 months ago
2008
IEEE
If there are more clusters than the ideal, each intrinsic cluster will be split into several subsets. Theoretically, this split can be arbitrary and neighboring data points have a ...