4047 search results - page 586 / 810 » The Discrete Basis Problem |
119
click to vote
SODA
2010
ACM
16 years 1 months ago
2010
ACM
We settle the 1-pass space complexity of (1 ? )approximating the Lp norm, for real p with 1 p 2, of a length-n vector updated in a length-m stream with updates to its coordinate...
141
click to vote
SDM
2009
SIAM
16 years 1 months ago
2009
SIAM
Latent Semantic Indexing (LSI) has been validated to be effective on many small scale text collections. However, little evidence has shown its effectiveness on unsampled large sca...
160
click to vote
SAC
2010
ACM
15 years 11 months ago
2010
ACM
Ordinal regression (also known as ordinal classification) is a supervised learning task that consists of automatically determining the implied rating of a data item on a fixed, ...
128
Voted
EVOW
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. We revisit Gaussian Adaptation (GaA), a black-box optimizer for discrete and continuous problems that has been developed in the late 1960’s. This largely neglected sear...
135
click to vote
SAC
2009
ACM
15 years 11 months ago
2009
ACM
We formalize paper fold (origami) by graph rewriting. Origami construction is abstractly described by a rewriting sys), where O is the set of abstract origami’s and ary relation...