Sciweavers

1127 search results - page 25 / 226
» New Algorithms for Generalized Network Flows
Sort
View
WSCG
2004
118views more  WSCG 2004»
14 years 11 months ago
Combining Geometrical and Mechanical Displacements for Suppressing Intersections in Cartographic Generalization
This paper describes a method for suppressing spatial conflicts in cartographic generalization of isobathymetric lines. These lines are modeled by parametric curves. For that purp...
Eric Guilbert, Eric Saux, Marc Daniel
IPSN
2007
Springer
15 years 4 months ago
NIST smart data flow system II: speaker localization
Multimodal applications require the acquisition and processing of massive amounts of information from multiple sensors. Because this process is beyond the capabilities of a single...
Antoine Fillinger, Lukas Diduch, Imad Hamchi, St&e...
GLOBECOM
2010
IEEE
14 years 8 months ago
Mixed Time-Scale Generalized Fair Scheduling for Amplify-and-Forward Relay Networks
Abstract--We devise an optimization framework for generalized proportional fairness (GPF) under different time scales for amplify-and-forward (AF) relay networks. In GPF scheduling...
Alireza Sharifian, Petar Djukic, Halim Yanikomerog...
SC
1990
ACM
15 years 2 months ago
Loop distribution with arbitrary control flow
Loop distribution is an integral part of transforming a sequential program into a parallel one. It is used extensively in parallelization,vectorization, and memory management. For...
Ken Kennedy, Kathryn S. McKinley
CCR
2006
82views more  CCR 2006»
14 years 10 months ago
Why flow-completion time is the right metric for congestion control
Users typically want their flows to complete as quickly as possible: They want a web-page to download quickly, or a file transfer to complete as rapidly as possible. In other words...
Nandita Dukkipati, Nick McKeown