Sciweavers

209 search results - page 42 / 42
» Reachability and the Power of Local Ordering
Sort
View
CCE
2005
13 years 6 months ago
CFD analyses of complex flows
Computational fluid dynamics (CFD) of complex processes and complicated geometries embraces the transport of momentum, heat, and mass including the description of reaction kinetic...
Richard Farmer, Ralph Pike, Gary Cheng
TWC
2008
141views more  TWC 2008»
13 years 6 months ago
Progressive Accumulative Routing: Fundamental Concepts and Protocol
This paper considers a multi-hop network in which relay nodes cooperate to minimize the total energy consumed in transmitting a (unicast) packet from a source to a destination. We...
Raymond Yim, Neelesh B. Mehta, Andreas F. Molisch,...
COCO
2011
Springer
217views Algorithms» more  COCO 2011»
12 years 5 months ago
Noisy Interpolation of Sparse Polynomials, and Applications
Let f ∈ Fq[x] be a polynomial of degree d ≤ q/2. It is well-known that f can be uniquely recovered from its values at some 2d points even after some small fraction of the valu...
Shubhangi Saraf, Sergey Yekhanin
TOG
2012
230views Communications» more  TOG 2012»
11 years 8 months ago
Decoupling algorithms from schedules for easy optimization of image processing pipelines
Using existing programming tools, writing high-performance image processing code requires sacrificing readability, portability, and modularity. We argue that this is a consequenc...
Jonathan Ragan-Kelley, Andrew Adams, Sylvain Paris...