5115 search results - page 33 / 1023 » On Randomized Lanczos Algorithms |
102
click to vote
CSREASAM
2003
15 years 1 months ago
2003
We introduce and analyze a randomized traitor tracing algorithm for broadcast security. This algorithm is very efficient compared to brute force methods (the mean time it takes is...
134
Voted
OL
2011
14 years 6 months ago
2011
We demonstrate that the Linear Multidimensional Assignment Problem with iid random costs is polynomially "-approximable almost surely (a. s.) via a simple greedy heuristic, f...
CP
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. Machine learning can be utilized to build models that predict the runtime of search algorithms for hard combinatorial problems. Such empirical hardness models have previo...
70
Voted
SAGA
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. Devices connected wirelessly, in various forms including computers, hand-held devices, ad hoc networks, and embedded systems, are expected to become ubiquitous all around...
COMPGEOM
1993
ACM
15 years 3 months ago
1993
ACM
For a polygon P, the bounded Voronoi diagram of P is a partition of P into regions assigned to the vertices of P. A point p inside P belongs to the region of a vertex v if and onl...