Sciweavers

5153 search results - page 750 / 1031
» Introduction to Randomized Algorithms
Sort
View
PODC
2004
ACM
15 years 9 months ago
Analyzing Kleinberg's (and other) small-world Models
We analyze the properties of Small-World networks, where links are much more likely to connect “neighbor nodes” than distant nodes. In particular, our analysis provides new re...
Charles U. Martel, Van Nguyen
370
Voted

Publication
1851views
17 years 5 months ago
Cerebrovascular Segmentation from TOF Using Stochastic Models
In this paper, we present an automatic statistical approach for extracting 3D blood vessels from time-of-flight (TOF) magnetic resonance angiography (MRA) data. The voxels of the d...
M. Sabry Hassouna, Aly A. Farag, Stephen Hushek, T...
WWW
2003
ACM
16 years 4 months ago
On the bursty evolution of blogspace
We propose two new tools to address the evolution of hyperlinked corpora. First, we define time graphs to extend the traditional notion of an evolving directed graph, capturing li...
Ravi Kumar, Jasmine Novak, Prabhakar Raghavan, And...
144
Voted
STOC
2009
ACM
171views Algorithms» more  STOC 2009»
16 years 4 months ago
On the geometry of graphs with a forbidden minor
We study the topological simplification of graphs via random embeddings, leading ultimately to a reduction of the Gupta-Newman-Rabinovich-Sinclair (GNRS) L1 embedding conjecture t...
James R. Lee, Anastasios Sidiropoulos
STOC
2009
ACM
167views Algorithms» more  STOC 2009»
16 years 4 months ago
Universally utility-maximizing privacy mechanisms
A mechanism for releasing information about a statistical database with sensitive data must resolve a trade-off between utility and privacy. Publishing fully accurate information ...
Arpita Ghosh, Tim Roughgarden, Mukund Sundararajan