Sciweavers

5153 search results - page 504 / 1031
» Introduction to Randomized Algorithms
Sort
View
KDD
2003
ACM
150views Data Mining» more  KDD 2003»
16 years 6 months ago
Learning relational probability trees
Classification trees are widely used in the machine learning and data mining communities for modeling propositional data. Recent work has extended this basic paradigm to probabili...
Jennifer Neville, David Jensen, Lisa Friedland, Mi...
SODA
2010
ACM
214views Algorithms» more  SODA 2010»
16 years 3 months ago
Amplified Hardness of Approximation for VCG-Based Mechanisms
If a two-player social welfare maximization problem does not admit a PTAS, we prove that any maximal-in-range truthful mechanism that runs in polynomial time cannot achieve an app...
Shaddin Dughmi, Hu Fu, Robert Kleinberg
ICASSP
2009
IEEE
16 years 1 months ago
The speed of greed: Characterizing myopic gossip through network voracity
This paper analyzes the rate of convergence of greedy gossip with eavesdropping (GGE). In previous work, we proposed GGE, a fast gossip algorithm based on exploiting the broadcast...
Deniz Üstebay, Boris N. Oreshkin, Mark Coates...
CEC
2008
IEEE
16 years 29 days ago
Fast symmetric keys generation via mutual mirroring process
—This paper presents an eavesdropper-proof algorithm that is capable of fast generating symmetric (secret) keys. Instead of literally exchanging secret keys, both the sender and ...
Chun-Shun Tseng, Ya-Yun Jheng, Sih-Yin Shen, Jung-...
FOCS
2008
IEEE
16 years 29 days ago
On the Value of Multiple Read/Write Streams for Approximating Frequency Moments
We consider the read/write streams model, an extension of the standard data stream model in which an algorithm can create and manipulate multiple read/write streams in addition to...
Paul Beame, Dang-Trinh Huynh-Ngoc