Sciweavers

9888 search results - page 1975 / 1978
» compute 2009
Sort
View
88
Voted
TCS
2010
14 years 8 months ago
Itineraries of rigid rotations and diffeomorphisms of the circle
We examine the itinerary of 0 ∈ S1 = R/Z under the rotation by α ∈ R\Q. The motivating question is: if we are given only the itinerary of 0 relative to I ⊂ S1 , a finite un...
David Richeson, Paul Winkler, Jim Wiseman
87
Voted
STOC
2009
ACM
168views Algorithms» more  STOC 2009»
15 years 11 months ago
Fault-tolerant spanners for general graphs
The paper concerns graph spanners that are resistant to vertex or edge failures. Given a weighted undirected n-vertex graph G = (V, E) and an integer k 1, the subgraph H = (V, E ...
Shiri Chechik, Michael Langberg, David Peleg, Liam...
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
15 years 11 months ago
Finding, minimizing, and counting weighted subgraphs
d Abstract] Virginia Vassilevska School of Mathematics Institute for Advanced Study Princeton, NJ 08540 USA virgi@math.ias.edu Ryan Williams School of Mathematics Institute for Adv...
Virginia Vassilevska, Ryan Williams
101
Voted
CCS
2009
ACM
15 years 11 months ago
On the feasibility of launching the man-in-the-middle attacks on VoIP from remote attackers
The man-in-the-middle (MITM) attack has been shown to be one of the most serious threats to the security and trust of existing VoIP protocols and systems. For example, the MITM wh...
Ruishan Zhang, Xinyuan Wang, Ryan Farley, Xiaohui ...
93
Voted
KDD
2009
ACM
191views Data Mining» more  KDD 2009»
15 years 10 months ago
Scalable pseudo-likelihood estimation in hybrid random fields
Learning probabilistic graphical models from high-dimensional datasets is a computationally challenging task. In many interesting applications, the domain dimensionality is such a...
Antonino Freno, Edmondo Trentin, Marco Gori
« Prev « First page 1975 / 1978 Last » Next »