901 search results - page 38 / 181 » Analyzing linear mergers |
103
click to vote
SIAMJO
2010
14 years 6 months ago
2010
We study the problem of minimizing the expected loss of a linear predictor while constraining its sparsity, i.e., bounding the number of features used by the predictor. While the r...
ANTS
1994
Springer
15 years 3 months ago
1994
Springer
We study the complexity of expressing the greatest common divisor of n positive numbers as a linear combination of the numbers. We prove the NP-completeness of finding an optimal s...
129
click to vote
ACNS
2011
Springer
14 years 2 months ago
2011
Springer
Abstract. Recent developments in the field of cryptanalysis of hash functions has inspired NIST to announce a competition for selecting a new cryptographic hash function to join t...
110
click to vote
SODA
2010
ACM
15 years 8 months ago
2010
ACM
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
99
Voted
IPSN
2004
Springer
15 years 4 months ago
2004
Springer
Due to constraints in cost, power, and communication, losses often arise in large sensor networks. The sensor can be modeled as an output of a linear stochastic system with random...