227 search results - page 34 / 46 » Complexity Results for Compressing Optimal Paths |
129
Voted
FOCS
1999
IEEE
15 years 8 months ago
1999
IEEE
Naor and Yung show that a one-bit-compressing universal one-way hash function (UOWHF) can be constructed based on a one-way permutation. This construction can be iterated to build...
135
click to vote
ICML
2010
IEEE
15 years 5 months ago
2010
IEEE
We propose a novel boosting algorithm which improves on current algorithms for weighted voting classification by striking a better balance between classification accuracy and the ...
149
click to vote
GLOBECOM
2006
IEEE
15 years 10 months ago
2006
IEEE
Abstract—We consider the distributed estimation of an unknown vector signal in a resource constrained sensor network with a fusion center. Due to power and bandwidth limitations,...
146
click to vote
NIPS
1997
15 years 5 months ago
1997
I present an expectation-maximization (EM) algorithm for principal component analysis (PCA). The algorithm allows a few eigenvectors and eigenvalues to be extracted from large col...
146
click to vote
CORR
2010
Springer
15 years 19 days ago
2010
Springer
Max Restricted Path Consistency (maxRPC) is a local consistency for binary constraints that can achieve considerably stronger pruning than arc consistency. However, existing maxRPC...