Sciweavers

5595 search results - page 890 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
INFOCOM
2008
IEEE
16 years 27 days ago
Cell Selection in 4G Cellular Networks
—Cell selection is the process of determining the cell(s) that provide service to each mobile station. Optimizing these processes is an important step towards maximizing the util...
David Amzallag, Reuven Bar-Yehuda, Danny Raz, Gabr...
IPPS
2006
IEEE
16 years 16 days ago
Battery-aware router scheduling in wireless mesh networks
Wireless mesh networks recently emerge as a flexible, low-cost and multipurpose networking platform with wired infrastructure connected to the Internet. A critical issue in mesh ...
Chi Ma, Zhenghao Zhang, Yuanyuan Yang
SDM
2010
SIAM
202views Data Mining» more  SDM 2010»
15 years 4 months ago
Multiresolution Motif Discovery in Time Series
Time series motif discovery is an important problem with applications in a variety of areas that range from telecommunications to medicine. Several algorithms have been proposed t...
Nuno Castro, Paulo J. Azevedo
ICC
2007
IEEE
124views Communications» more  ICC 2007»
16 years 25 days ago
On Achieving Maximum Network Lifetime Through Optimal Placement of Cluster-heads in Wireless Sensor Networks
—In a wireless sensor network, the network lifetime is an important issue when the size of the network is large. In order to make the network scalable, it is divided into a numbe...
Marudachalam Dhanaraj, C. Siva Ram Murthy
DKE
2008
79views more  DKE 2008»
15 years 6 months ago
Extracting k most important groups from data efficiently
We study an important data analysis operator, which extracts the k most important groups from data (i.e., the k groups with the highest aggregate values). In a data warehousing co...
Man Lung Yiu, Nikos Mamoulis, Vagelis Hristidis