Sciweavers

2127 search results - page 388 / 426
» Computing large matchings fast
Sort
View
BMCBI
2007
107views more  BMCBI 2007»
14 years 12 months ago
A general and efficient method for estimating continuous IBD functions for use in genome scans for QTL
Background: Identity by descent (IBD) matrix estimation is a central component in mapping of Quantitative Trait Loci (QTL) using variance component models. A large number of algor...
Francois Besnier, Örjan Carlborg
CONCURRENCY
2010
130views more  CONCURRENCY 2010»
14 years 12 months ago
Enabling high-speed asynchronous data extraction and transfer using DART
As the complexity and scale of current scientific and engineering applications grow, managing and transporting the large amounts of data they generate is quickly becoming a signif...
Ciprian Docan, Manish Parashar, Scott Klasky
116
Voted
CGF
2006
173views more  CGF 2006»
14 years 12 months ago
C-BDAM - Compressed Batched Dynamic Adaptive Meshes for Terrain Rendering
We describe a compressed multiresolution representation for supporting interactive rendering of very large planar and spherical terrain surfaces. The technique, called Compressed ...
Enrico Gobbetti, Fabio Marton, Paolo Cignoni, Marc...
DSS
2007
113views more  DSS 2007»
14 years 11 months ago
An information delivery system with automatic summarization for mobile commerce
Wireless access with handheld devices is a promising addition to the WWW and traditional electronic business. Handheld devices provide convenience and portable access to the huge ...
Christopher C. Yang, Fu Lee Wang
ALGORITHMICA
2011
14 years 6 months ago
All-Pairs Bottleneck Paths in Vertex Weighted Graphs
Let G = (V, E, w) be a directed graph, where w : V → R is an arbitrary weight function defined on its vertices. The bottleneck weight, or the capacity, of a path is the smalles...
Asaf Shapira, Raphael Yuster, Uri Zwick