Sciweavers

774 search results - page 110 / 155
» Factors of generalized Fermat numbers
Sort
View
ICDT
2009
ACM
147views Database» more  ICDT 2009»
14 years 10 months ago
The average-case complexity of counting distinct elements
We continue the study of approximating the number of distinct elements in a data stream of length n to within a (1? ) factor. It is known that if the stream may consist of arbitra...
David P. Woodruff
WWW
2005
ACM
14 years 10 months ago
A convenient method for securely managing passwords
Computer users are asked to generate, keep secret, and recall an increasing number of passwords for uses including host accounts, email servers, e-commerce sites, and online finan...
J. Alex Halderman, Brent Waters, Edward W. Felten
STOC
2009
ACM
171views Algorithms» more  STOC 2009»
14 years 10 months ago
On the geometry of graphs with a forbidden minor
We study the topological simplification of graphs via random embeddings, leading ultimately to a reduction of the Gupta-Newman-Rabinovich-Sinclair (GNRS) L1 embedding conjecture t...
James R. Lee, Anastasios Sidiropoulos
STOC
2002
ACM
156views Algorithms» more  STOC 2002»
14 years 10 months ago
Selfish traffic allocation for server farms
We investigate the price of selfish routing in non-cooperative networks in terms of the coordination and bicriteria ratios in the recently introduced game theoretic network model ...
Artur Czumaj, Piotr Krysta, Berthold Vöcking
MOBISYS
2004
ACM
14 years 9 months ago
Improving the Latency of 802.11 hand-offs using Neighbor Graphs
The 802.11 IEEE Standard has enabled low cost and effective wireless LAN services (WLAN). With the sales and deployment of WLAN based networks exploding, many people believe that ...
Minho Shin, Arunesh Mishra, William A. Arbaugh