Sciweavers

2004 search results - page 32 / 401
» Sampling from large graphs
Sort
View
APVIS
2008
15 years 3 months ago
ZAME: Interactive Large-Scale Graph Visualization
We present the Zoomable Adjacency Matrix Explorer (ZAME), a visualization tool for exploring graphs at a scale of millions of nodes and edges. ZAME is based on an adjacency matrix...
Niklas Elmqvist, Thanh-Nghi Do, Howard Goodell, Na...
SIGECOM
2006
ACM
143views ECommerce» more  SIGECOM 2006»
15 years 8 months ago
Braess's paradox in large random graphs
Braess’s Paradox is the counterintuitive but well-known fact that removing edges from a network with “selfish routing” can decrease the latency incurred by traffic in an eq...
Gregory Valiant, Tim Roughgarden
COMCOM
2010
179views more  COMCOM 2010»
15 years 2 months ago
On the statistical characterization of flows in Internet traffic with application to sampling
A new method of estimating some statistical characteristics of TCP flows in the Internet is developed in this paper. For this purpose, a new set of random variables (referred to as...
Yousra Chabchoub, Christine Fricker, Fabrice Guill...
CORR
1998
Springer
98views Education» more  CORR 1998»
15 years 1 months ago
Bayesian Stratified Sampling to Assess Corpus Utility
This paper describes a method for asking statistical questions about a large text corpus. We exemplify the method by addressing the question, "What percentage of Federal Regi...
Judith Hochberg, Clint Scovel, Timothy Thomas, Sam...
ICCV
2007
IEEE
16 years 3 months ago
Efficient Multi-View Reconstruction of Large-Scale Scenes using Interest Points, Delaunay Triangulation and Graph Cuts
We present a novel method to reconstruct the 3D shape of a scene from several calibrated images. Our motivation is that most existing multi-view stereovision approaches require so...
Patrick Labatut, Jean-Philippe Pons, Renaud Kerive...