Sciweavers

2609 search results - page 285 / 522
» Optimizing for parallelism and data locality
Sort
View
SPAA
2006
ACM
16 years 19 days ago
Playing push vs pull: models and algorithms for disseminating dynamic data in networks
Consider a network in which a collection of source nodes maintain and periodically update data objects for a collection of sink nodes, each of which periodically accesses the data...
R. C. Chakinala, Abishek Kumarasubramanian, Kofi A...
ICPR
2008
IEEE
16 years 7 months ago
Time-series clustering by approximate prototypes
Clustering time-series data poses problems, which do not exist in traditional clustering in Euclidean space. Specifically, cluster prototype needs to be calculated, where common s...
Pasi Fränti, Pekka Nykänen, Ville Hautam...
ICPR
2002
IEEE
16 years 7 months ago
Radial Projections for Non-Linear Feature Extraction
In this work, two new techniques for non-linear feature extraction are presented. In these techniques, new features are obtained as radial projections of the original measurements...
Alberto J. Pérez Jiménez, Juan Carlo...
AAAI
2008
15 years 9 months ago
Visualization of Large-Scale Weighted Clustered Graph: A Genetic Approach
In this paper, a bottom-up hierarchical genetic algorithm is proposed to visualize clustered data into a planar graph. To achieve global optimization by accelerating local optimiz...
Jiayu Zhou, Youfang Lin, Xi Wang
IPPS
2008
IEEE
16 years 1 months ago
A game theoretical data replication technique for mobile ad hoc networks
Adaptive replication of data items on servers of a mobile ad hoc network can alleviate access delays. The selection of data items and servers requires solving a constrained optimi...
Samee Ullah Khan, Anthony A. Maciejewski, Howard J...