5153 search results - page 344 / 1031 » Introduction to Randomized Algorithms |
152
click to vote
WADS
2009
Springer
15 years 11 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 ...
134
click to vote
ICC
2008
IEEE
15 years 11 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...
136
click to vote
ICPP
2006
IEEE
15 years 10 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...
127
click to vote
CCGRID
2005
IEEE
15 years 10 months 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...
125
click to vote
WADS
2005
Springer
15 years 10 months ago
2005
Springer
We obtain subquadratic algorithms for 3SUM on integers and rationals in several models. On a standard word RAM with w-bit words, we obtain a running time of O(n2 / max{ w lg2 w , ...