Sciweavers

29046 search results - page 198 / 5810
» Computable Models
Sort
View
SMA
2006
ACM
132views Solid Modeling» more  SMA 2006»
16 years 12 days ago
Generalized penetration depth computation
— We present an efficient algorithm to compute the generalized penetration depth (PDg) between rigid models. Given two overlapping objects, our algorithm attempts to compute the...
Liangjun Zhang, Young J. Kim, Gokul Varadhan, Dine...
GLOBECOM
2008
IEEE
16 years 28 days ago
Performance Metric Sensitivity Computation for Optimization and Trade-Off Analysis in Wireless Networks
Abstract—We develop and evaluate a new method for estimating and optimizing various performance metrics for multihop wireless networks, including MANETs. We introduce an approxim...
John S. Baras, Vahid Tabatabaee, George Papageorgi...
INFOCOM
2008
IEEE
16 years 26 days ago
Approximation Algorithms for Computing Capacity of Wireless Networks with SINR Constraints
—A fundamental problem in wireless networks is to estimate its throughput capacity - given a set of wireless nodes, and a set of connections, what is the maximum rate at which da...
Deepti Chafekar, V. S. Anil Kumar, Madhav V. Marat...
PC
2007
133views Management» more  PC 2007»
15 years 6 months ago
Data distribution for dense factorization on computers with memory heterogeneity
In this paper, we study the problem of optimal matrix partitioning for parallel dense factorization on heterogeneous processors. First, we outline existing algorithms solving the ...
Alexey L. Lastovetsky, Ravi Reddy
OOPSLA
2010
Springer
15 years 4 months ago
Language virtualization for heterogeneous parallel computing
As heterogeneous parallel systems become dominant, application developers are being forced to turn to an incompatible mix of low level programming models (e.g. OpenMP, MPI, CUDA, ...
Hassan Chafi, Zach DeVito, Adriaan Moors, Tiark Ro...