Sciweavers

1487 search results - page 26 / 298
» The Computational Complexity of Link Building
Sort
View
IPPS
2008
IEEE
14 years 2 months ago
Build to order linear algebra kernels
—The performance bottleneck for many scientific applications is the cost of memory access inside linear algebra kernels. Tuning such kernels for memory efficiency is a complex ...
Jeremy G. Siek, Ian Karlin, Elizabeth R. Jessup

Publication
397views
14 years 10 months ago
Build it but where? A GIS methodology for guiding the planning of new cycling facilities
Concern over climate change, traffic congestion, and the health consequences of sedentary lifestyles has resulted in a surge of interest in cycling as an efficient form of urban ...
Larsen, J. & El-Geneidy, M.
SAC
2008
ACM
13 years 8 months ago
Privacy-preserving link discovery
Abstract. Link discovery is a process of identifying association(s) among different entities included in a complex network structure. These association(s) may represent any interac...
Xiaoyun He, Basit Shafiq, Jaideep Vaidya, Nabil R....
CGF
1998
127views more  CGF 1998»
13 years 8 months ago
Getting Rid of Links in Hierarchical Radiosity
Hierarchical radiosity with clustering has positioned itself as one of the most efficient algorithms for computing global illumination in non-trivial environments. However, using...
Marc Stamminger, Hartmut Schirmacher, Philipp Slus...
EUC
2005
Springer
14 years 2 months ago
Asymmetry-Aware Link Quality Services in Wireless Sensor Networks
Recent studies in wireless sensor networks (WSN) have observed that the irregular link quality is a common phenomenon, rather than an anomaly. The irregular link quality, especiall...
Junzhao Du, Weisong Shi, Kewei Sha