Sciweavers

836 search results - page 149 / 168
» Orthogonal Colorings of Graphs
Sort
View
TIT
2011
131views more  TIT 2011»
14 years 8 months ago
On the Hardness of Approximating the Network Coding Capacity
Abstract—This work addresses the computational complexity of achieving the capacity of a general network coding instance. We focus on the linear capacity, namely the capacity of ...
Michael Langberg, Alexander Sprintson
SI3D
1999
ACM
15 years 6 months ago
Applications of pixel textures in visualization and realistic image synthesis
With fast 3D graphics becoming more and more available even on low end platforms, the focus in developing new graphics hardware is beginning to shift towards higher quality render...
Wolfgang Heidrich, Rüdiger Westermann, Hans-P...
SIAMSC
2008
140views more  SIAMSC 2008»
15 years 1 months ago
Compact Fourier Analysis for Designing Multigrid Methods
The convergence of Multigrid methods can be analyzed based on a Fourier analysis of the method or by proving certain inequalities that have to be fulfilled by the smoother and by t...
Thomas K. Huckle
GLOBECOM
2008
IEEE
15 years 8 months ago
Multi-Cluster Multi-Parent Wake-Up Scheduling in Delay-Sensitive Wireless Sensor Networks
—Immediate notification of urgent but rare events and delivery of time sensitive actuation commands appear in many practical wireless sensor and actuator network applications. M...
Huang Lee, Abtin Keshavarzian, Hamid K. Aghajan
FOCS
2007
IEEE
15 years 8 months ago
Adaptive Simulated Annealing: A Near-optimal Connection between Sampling and Counting
We present a near-optimal reduction from approximately counting the cardinality of a discrete set to approximately sampling elements of the set. An important application of our wo...
Daniel Stefankovic, Santosh Vempala, Eric Vigoda