Sciweavers

310 search results - page 9 / 62
» Why Delannoy numbers
Sort
View
GECCO
2006
Springer
161views Optimization» more  GECCO 2006»
14 years 1 months ago
An empirical investigation of how and why neutrality affects evolutionary search
The effects of neutrality on evolutionary search have been considered in a number of interesting studies, the results of which, however, have been contradictory. Some researchers ...
Edgar Galván López, Riccardo Poli
ICWSM
2010
13 years 11 months ago
Who Acquires Friends Through Social Media and Why? "Rich Get Richer" Versus "Seek and Ye Shall Find"
There is an ongoing debate, not just among academics but in popular culture, about whether social media can expand people's social networks, and whether online friends can be...
Zeynep Tufekci
SODA
2008
ACM
110views Algorithms» more  SODA 2008»
13 years 11 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
SP
1997
IEEE
139views Security Privacy» more  SP 1997»
14 years 1 months ago
Number Theoretic Attacks on Secure Password Schemes
Encrypted Key Exchange (EKE) [1, 2] allows two parties sharing a password to exchange authenticated information over an insecure network by using a combination of public and secre...
Sarvar Patel
WAOA
2010
Springer
232views Algorithms» more  WAOA 2010»
13 years 7 months ago
Approximation Algorithms for Domination Search
The r-domination search game on graphs is a game-theoretical approach to several graph and hypergraph parameters including treewidth and hypertree width. The task is to identify t...
Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thi...