Sciweavers

310 search results - page 49 / 62
» Why Delannoy numbers
Sort
View
SIGIR
2010
ACM
14 years 1 months ago
The importance of anchor text for ad hoc search revisited
It is generally believed that propagated anchor text is very important for effective Web search as offered by the commercial search engines. “Google Bombs” are a notable illus...
Marijn Koolen, Jaap Kamps
SODA
2008
ACM
104views Algorithms» more  SODA 2008»
13 years 11 months ago
Ranged hash functions and the price of churn
Ranged hash functions generalize hash tables to the setting where hash buckets may come and go over time, a typical case in distributed settings where hash buckets may correspond ...
James Aspnes, Muli Safra, Yitong Yin
BMCBI
2007
110views more  BMCBI 2007»
13 years 10 months ago
Analysis of feedback loops and robustness in network evolution based on Boolean models
Background: Many biological networks such as protein-protein interaction networks, signaling networks, and metabolic networks have topological characteristics of a scale-free degr...
Yung-Keun Kwon, Kwang-Hyun Cho
CCR
2008
106views more  CCR 2008»
13 years 10 months ago
Message-efficient dissemination for loop-free centralized routing
With steady improvement in the reliability and performance of communication devices, routing instabilities now contribute to many of the remaining service degradations and interru...
Haldane Peterson, Soumya Sen, Jaideep Chandrasheka...
CORR
2010
Springer
116views Education» more  CORR 2010»
13 years 10 months ago
Where are the hard manipulation problems?
One possible escape from the Gibbard-Satterthwaite theorem is computational complexity. For example, it is NP-hard to compute if the STV rule can be manipulated. However, there is...
Toby Walsh