Sciweavers

2681 search results - page 137 / 537
» Problem F
Sort
View
EWC
2008
117views more  EWC 2008»
13 years 10 months ago
Performance of parallel computations with dynamic processor allocation
In parallel adaptive mesh refinement (AMR) computations the problem size can vary significantly during a simulation. The goal here is to explore the performance implications of dyn...
Saeed Iqbal, Graham F. Carey
SWAT
2010
Springer
279views Algorithms» more  SWAT 2010»
14 years 3 months ago
Online Function Tracking with Generalized Penalties
We attend to the classic setting where an observer needs to inform a tracker about an arbitrary time varying function f : N0 → Z. This is an optimization problem, where both wron...
Marcin Bienkowski, Stefan Schmid
ICASSP
2011
IEEE
13 years 2 months ago
Joint blind source separation from second-order statistics: Necessary and sufficient identifiability conditions
This paper considers the problem of joint blind source separation (J-BSS), which appears in many practical problems such as blind deconvolution or functional magnetic resonance im...
Javier Vía, Matthew Anderson, Xi-Lin Li, T&...
PODC
2009
ACM
14 years 11 months ago
Brief announcement: collaborative measurement of upload speeds in P2P systems
We define and study the bandwidth determination problem in adhoc P2P environments. Using point-to-point bandwidth probes, the goal is to quickly determine each host's upload ...
John R. Douceur, James W. Mickens, Thomas Moscibro...
STOC
2005
ACM
167views Algorithms» more  STOC 2005»
14 years 10 months ago
Approximately counting integral flows and cell-bounded contingency tables
We consider the problem of approximately counting integral flows in a network. We show that there is an fpras based on volume estimation if all capacities are sufficiently large, ...
Mary Cryan, Martin E. Dyer, Dana Randall