Sciweavers

533 search results - page 88 / 107
» A Very Mathematical Dilemma
Sort
View
WWW
2007
ACM
14 years 8 months ago
GigaHash: scalable minimal perfect hashing for billions of urls
A minimal perfect function maps a static set of keys on to the range of integers {0,1,2, ... , - 1}. We present a scalable high performance algorithm based on random graphs for ...
Kumar Chellapilla, Anton Mityagin, Denis Xavier Ch...
WWW
2006
ACM
14 years 8 months ago
Invisible participants: how cultural capital relates to lurking behavior
The asymmetry of activity in virtual communities is of great interest. While participation in the activities of virtual communities is crucial for a community's survival and ...
Vladimir Soroka, Sheizaf Rafaeli
TCC
2009
Springer
131views Cryptology» more  TCC 2009»
14 years 8 months ago
Secure Computability of Functions in the IT Setting with Dishonest Majority and Applications to Long-Term Security
It is well known that general secure function evaluation (SFE) with information-theoretical (IT) security is infeasible in presence of a corrupted majority in the standard model. ...
Robin Künzler, Jörn Müller-Quade, D...
TCC
2009
Springer
142views Cryptology» more  TCC 2009»
14 years 8 months ago
Chosen-Ciphertext Security via Correlated Products
We initiate the study of one-wayness under correlated products. We are interested in identifying necessary and sufficient conditions for a function f and a distribution on inputs ...
Alon Rosen, Gil Segev
KDD
2005
ACM
157views Data Mining» more  KDD 2005»
14 years 7 months ago
A fast kernel-based multilevel algorithm for graph clustering
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis