1802 search results - page 172 / 361 » Sparse Computations with PEI |
125
click to vote
SAC
2005
ACM
15 years 10 months ago
2005
ACM
We consider the problem of information retrieval in a peerto-peer file sharing system. We assume that peers are unreliable, metadata are sparse, and queries are short. In light o...
141
click to vote
ICCS
2005
Springer
15 years 10 months ago
2005
Springer
The Continuation of Invariant Subspaces (CIS) algorithm produces a smoothly varying basis for an invariant subspace R(s) of a parameter-dependent matrix A(s). In the case when A(s)...
124
click to vote
FLAIRS
2004
15 years 5 months ago
2004
What makes a good consistency ? Depending on the constraint, it may be a good pruning power or a low computational cost. By "weakening" arc-consistency, we propose to de...
144
click to vote
ACL
1994
15 years 5 months ago
1994
We present an algorithm for computing n-gram probabilities from stochastic context-free grammars, a procedure that can alleviate some of the standard problems associated with n-gr...
158
click to vote
ECCV
2008
Springer
15 years 5 months ago
2008
Springer
—This paper presents a fast part-based subspace selection algorithm, termed the binary sparse nonnegative matrix factorization (B-SNMF). Both the training process and the testing...