5115 search results - page 953 / 1023 » On Randomized Lanczos Algorithms |
140
Voted
MOBICOM
2005
ACM
15 years 8 months ago
2005
ACM
In old times, castles were surrounded by moats (deep trenches filled with water, and even alligators) to thwart or discourage intrusion attempts. One can now replace such barrier...
122
Voted
ICALP
2005
Springer
15 years 8 months ago
2005
Springer
Motivated by the study of algorithmic problems in the domain of information security, in this paper, we study the complexity of a new class of computations over a collection of va...
135
Voted
ISAAC
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. We consider bicriteria optimization problems and investigate the relationship between two standard approaches to solving them: (i) computing the Pareto curve and (ii) the...
115
Voted
KIVS
2005
Springer
15 years 8 months ago
2005
Springer
Peer-to-peer overlay networks have grown significantly in size and sophistication over the last years. Meanwhile, distributed hash tables (DHT) provide efficient means to create g...
138
Voted
MOBIHOC
2004
ACM
15 years 8 months ago
2004
ACM
In this work, we develop an analytical framework to investigate the behavior of the communication links of a node in a random mobility environment. Analytical expressions characte...