1511 search results - page 158 / 303 » Randomness, lowness and degrees |
168
click to vote
ALENEX
2010
15 years 7 months ago
2010
Previously [SODA'04] we devised the fastest known algorithm for 4-universal hashing. The hashing was based on small pre-computed 4-universal tables. This led to a five-fold i...
178
click to vote
BMCBI
2007
15 years 6 months ago
2007
Background: Many biological networks such as protein-protein interaction networks, signaling networks, and metabolic networks have topological characteristics of a scale-free degr...
161
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...
189
click to vote
GECCO
2010
Springer
15 years 11 months ago
2010
Springer
One method of viral marketing involves seeding certain consumers within a population to encourage faster adoption of the product throughout the entire population. However, determi...
167
click to vote
FOCS
2007
IEEE
15 years 10 months ago
2007
IEEE
We develop a new technique of proving lower bounds for the randomized communication complexity of boolean functions in the multiparty `Number on the Forehead' model. Our meth...