Sciweavers

1161 search results - page 43 / 233
» Approximation schemes for clustering problems
Sort
View
CLUSTER
2003
IEEE
15 years 3 months ago
Towards Load Balancing Support for I/O-Intensive Parallel Jobs in a Cluster of Workstations
While previous CPU- or memory-centric load balancing schemes are capable of achieving the effective usage of global CPU and memory resources in a cluster system, the cluster exhib...
Xiao Qin, Hong Jiang, Yifeng Zhu, David R. Swanson
ICML
2000
IEEE
15 years 10 months ago
Rates of Convergence for Variable Resolution Schemes in Optimal Control
This paper presents a general method to derive tight rates of convergence for numerical approximations in optimal control when we consider variable resolution grids. We study the ...
Andrew W. Moore, Rémi Munos
CORR
2011
Springer
214views Education» more  CORR 2011»
14 years 1 months ago
K-Median Clustering, Model-Based Compressive Sensing, and Sparse Recovery for Earth Mover Distance
We initiate the study of sparse recovery problems under the Earth-Mover Distance (EMD). Specifically, we design a distribution over m × n matrices A such that for any x, given A...
Piotr Indyk, Eric Price
IPL
2002
90views more  IPL 2002»
14 years 9 months ago
On the approximability of two tree drawing conventions
We consider two aesthetic criteria for the visualization of rooted trees: inclusion and tip-over. Finding the minimum area layout according to either of these two standards is an ...
Paolo Penna
ICC
2007
IEEE
113views Communications» more  ICC 2007»
15 years 4 months ago
Load-Balanced Clustering Algorithms for Wireless Sensor Networks
— In this paper, we investigate the problem of grouping the sensor nodes into clusters to enhance the overall scalability of the network. A selected set of nodes, known as gatewa...
Chor Ping Low, Can Fang, Jim Mee Ng, Yew Hock Ang