Sciweavers

975 search results - page 33 / 195
» Locality Optimization for Program Instances
Sort
View
107
Voted
IPPS
1999
IEEE
15 years 2 months ago
A Graph Based Framework to Detect Optimal Memory Layouts for Improving Data Locality
In order to extract high levels of performance from modern parallel architectures, the effective management of deep memory hierarchies is very important. While architectural advan...
Mahmut T. Kandemir, Alok N. Choudhary, J. Ramanuja...
TASE
2010
IEEE
14 years 4 months ago
Sensor Placement for Triangulation-Based Localization
Robots operating in a workspace can localize themselves by querying nodes of a sensor-network deployed in the same workspace. This paper addresses the problem of computing the min...
Onur Tekdas, Volkan Isler
BROADNETS
2005
IEEE
15 years 3 months ago
Multi-rate throughput optimization for wireless local area network anomaly problem
— Due to varying wireless channel conditions, the IEEE 802.11 wireless local area network (WLAN) standard supports multiple modulation types to accommodate the tradeoff between d...
Yu-Liang Kuo, Kun-Wei Lai, Frank Yeong-Sung Lin, Y...
NIPS
2007
14 years 11 months ago
Discriminative Batch Mode Active Learning
Active learning sequentially selects unlabeled instances to label with the goal of reducing the effort needed to learn a good classifier. Most previous studies in active learning...
Yuhong Guo, Dale Schuurmans
ISNN
2005
Springer
15 years 3 months ago
One-Bit-Matching ICA Theorem, Convex-Concave Programming, and Combinatorial Optimization
Recently, a mathematical proof is obtained in (Liu, Chiu, Xu, 2004) on the so called one-bit-matching conjecture that all the sources can be separated as long as there is an one-to...
Lei Xu