Sciweavers

833 search results - page 79 / 167
» Simpler and better approximation algorithms for network desi...
Sort
View
SIGMOD
2006
ACM
149views Database» more  SIGMOD 2006»
14 years 8 months ago
Efficient query processing on unstructured tetrahedral meshes
Modern scientific applications consume massive volumes of data produced by computer simulations. Such applications require new data management capabilities in order to scale to te...
Stratos Papadomanolakis, Anastassia Ailamaki, Juli...
CGF
2007
168views more  CGF 2007»
13 years 7 months ago
Global Illumination using Photon Ray Splatting
We present a novel framework for efficiently computing the indirect illumination in diffuse and moderately glossy scenes using density estimation techniques. Many existing global...
Robert Herzog, Vlastimil Havran, Shin-ichi Kinuwak...
STOC
2003
ACM
133views Algorithms» more  STOC 2003»
14 years 8 months ago
A fast algorithm for computing steiner edge connectivity
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
Richard Cole, Ramesh Hariharan
IPSN
2007
Springer
14 years 2 months ago
Underground structure monitoring with wireless sensor networks
Environment monitoring in coal mines is an important application of wireless sensor networks (WSNs) that has commercial potential. We discuss the design of a Structure-Aware Self-...
Mo Li, Yunhao Liu
MOBICOM
2006
ACM
14 years 1 months ago
On the complexity of scheduling in wireless networks
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
Gaurav Sharma, Ravi R. Mazumdar, Ness B. Shroff