1941 search results - page 94 / 389 » On the Hardness of Approximate Reasoning |
126
click to vote
ISCAS
2008
IEEE
15 years 6 months ago
2008
IEEE
— Non-negative matrix factorization (NMF), i.e. V ≈ WH where both V, W and H are non-negative has become a widely used blind source separation technique due to its part based r...
SIAMCO
2002
14 years 11 months ago
2002
There is a large literature on the rate of convergence problem for general unconstrained stochastic approximations. Typically, one centers the iterate n about the limit point then...
128
click to vote
CORR
2012
Springer
13 years 7 months ago
2012
Springer
A distance oracle is a compact representation of the shortest distance matrix of a graph. It can be queried to retrieve approximate distances and corresponding paths between any p...
106
click to vote
PODC
2012
ACM
13 years 2 months ago
2012
ACM
This paper proves a necessary and sufficient condition for the existence of iterative algorithms that achieve approximate Byzantine consensus in arbitrary directed graphs, where e...
175
Voted
SIGMOD
2008
ACM
16 years 1 days ago
2008
ACM
Mobile devices equipped with positioning capabilities (e.g., GPS) can ask location-dependent queries to Location Based Services (LBS). To protect privacy, the user location must n...