Sciweavers

2004 search results - page 50 / 401
» Sampling from large graphs
Sort
View
VISSYM
2003
15 years 1 months ago
Isosurfaces on Optimal Regular Samples
Volumetric samples on Cartesian lattices are less efficient than samples on body-centred cubic (BCC) lattices. We show how to construct isosurfaces on BCC lattices using several ...
Hamish Carr, Thomas Theußl, Torsten Möl...
GECCO
2008
Springer
184views Optimization» more  GECCO 2008»
15 years 26 days ago
Analysis of mammography reports using maximum variation sampling
A genetic algorithm (GA) was developed to implement a maximum variation sampling technique to derive a subset of data from a large dataset of unstructured mammography reports. It ...
Robert M. Patton, Barbara G. Beckerman, Thomas E. ...
RT
2004
Springer
15 years 5 months ago
Bixels: Picture Samples with Sharp Embedded Boundaries
Pixels store a digital image as a grid of point samples that can reconstruct a limited-bandwidth continuous 2-D source image. Although convenient for anti-aliased display, these b...
Jack Tumblin, Prasun Choudhury
INFOCOM
2010
IEEE
14 years 9 months ago
Sample Path Bounds for Long Memory FBM Traffic
Fractional Brownian motion (fBm) emerged as a useful model for self-similar and long-range dependent Internet traffic. Asymptotic, respectively, approximate performance measures ar...
Amr Rizk, Markus Fidler
JSAC
2006
199views more  JSAC 2006»
14 years 11 months ago
IDES: An Internet Distance Estimation Service for Large Networks
The responsiveness of networked applications is limited by communications delays, making network distance an important parameter in optimizing the choice of communications peers. S...
Yun Mao, Lawrence K. Saul, Jonathan M. Smith