5115 search results - page 336 / 1023 » On Randomized Lanczos Algorithms |
160
click to vote
ASIACRYPT
2009
Springer
16 years 1 months ago
2009
Springer
An r-collision for a function is a set of r distinct inputs with identical outputs. Actually finding r-collisions for a random map over a finite set of cardinality N requires at ...
219
click to vote
WADS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Algorithms dealing with massive data sets are usually designed for I/O-efficiency, often captured by the I/O model by Aggarwal and Vitter. Another aspect of dealing with ...
206
click to vote
ICC
2008
IEEE
16 years 1 months ago
2008
IEEE
— Scheduling in an ad hoc wireless network suffers from the non-convexity of the cost function, caused by the interference between communication links. In previous optimization t...
208
click to vote
ICPP
2006
IEEE
16 years 1 months ago
2006
IEEE
stractions are extensively used to understand and solve challenging computational problems in various scientific and engineering domains. They have particularly gained prominence...
187
click to vote
CCGRID
2005
IEEE
16 years 29 days ago
2005
IEEE
— The global internet is rich in commodity resources but scarce in specialized resources. We argue that a grid framework can achieve better performance if it separates management...