10146 search results - page 347 / 2030 » Fast FAST |
134
click to vote
CIKM
2009
Springer
15 years 11 months ago
2009
Springer
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
124
Voted
COCOON
2009
Springer
15 years 11 months ago
2009
Springer
We discuss the nearly equitable edge coloring problem on a multigraph and propose an efficient algorithm for solving the problem, which has a better time complexity than the previ...
CPM
2009
Springer
15 years 11 months ago
2009
Springer
130
click to vote
CRYPTO
2009
Springer
15 years 11 months ago
2009
Springer
The well-studied task of learning a linear function with errors is a seemingly hard problem and the basis for several cryptographic schemes. Here we demonstrate additional applicat...