Sciweavers

5115 search results - page 305 / 1023
» On Randomized Lanczos Algorithms
Sort
View
IPPS
2005
IEEE
16 years 25 days ago
Optimal Oblivious Path Selection on the Mesh
— In the oblivious path selection problem, each packet in the network independently chooses a path, which is an important property if the routing algorithm is to be independent o...
Costas Busch, Malik Magdon-Ismail, Jing Xi
CRYPTO
2003
Springer
124views Cryptology» more  CRYPTO 2003»
16 years 14 days ago
Primality Proving via One Round in ECPP and One Iteration in AKS
On August 2002, Agrawal, Kayal and Saxena announced the first deterministic and polynomial time primality testing algorithm. For an input n, the AKS algorithm runs in heuristic t...
Qi Cheng
AAAI
2012
13 years 9 months ago
Online Task Assignment in Crowdsourcing Markets
We explore the problem of assigning heterogeneous tasks to workers with different, unknown skill sets in crowdsourcing markets such as Amazon Mechanical Turk. We first formalize ...
Chien-Ju Ho, Jennifer Wortman Vaughan
SODA
2008
ACM
110views Algorithms» more  SODA 2008»
15 years 8 months ago
Why simple hash functions work: exploiting the entropy in a data stream
Hashing is fundamental to many algorithms and data structures widely used in practice. For theoretical analysis of hashing, there have been two main approaches. First, one can ass...
Michael Mitzenmacher, Salil P. Vadhan
EP
1998
Springer
15 years 11 months ago
Generating, Visualizing, and Evaluating High-Quality Clusters for Information Organization
We present and analyze the star clustering algorithm. We discuss an implementation of this algorithm that supports browsing and document retrieval through information organization...
Javed A. Aslam, Katya Pelekhov, Daniela Rus