Sciweavers

2600 search results - page 258 / 520
» Clustering with or without the Approximation
Sort
View
ANSS
2006
IEEE
16 years 10 days ago
Swarm-based Active Tunable Routing for Overhead Reduction in Multiservice Networks
The explosive growth of multimedia and other bandwidth intensive applications has resulted a rapid increase in the size of the traffic loads that needs to be supported by modern n...
Constandinos X. Mavromoustakis, Helen D. Karatza
INFOSCALE
2006
ACM
16 years 6 days ago
A generic search strategy for large-scale real-world networks
— We consider the following situation for a given large-scale network: Starting from an initial node we move to its neighbor node and repeat that until reaching a target node. Ho...
Yuichi Kurumida, Tsukasa Ogata, Hirotaka Ono, Kuni...
IWCMC
2006
ACM
16 years 6 days ago
Performance of Taroko: a cluster-based addressing and routing scheme for self-organized networks
Self-Organized Networks (SONs) are a general description of autonomous networks without infrastructure, of which Ad Hoc, Sensor and Mesh networks are special cases. We had previou...
Julien Ridoux, Meriem Kassar, Mathias Boc, Anne Fl...
CCGRID
2005
IEEE
15 years 12 months ago
A batch scheduler with high level components
In this article we present the design choices and the evaluation of a batch scheduler for large clusters, named OAR. This batch scheduler is based upon an original design that emp...
Nicolas Capit, Georges Da Costa, Yiannis Georgiou,...
ICTAI
2003
IEEE
15 years 11 months ago
A Novel Bag Generator for Image Database Retrieval With Multi-Instance Learning Techniques
In multi-instance learning, the training examples are bags composed of instances without labels and the task is to predict the labels of unseen bags through analyzing the training...
Zhi-Hua Zhou, Min-Ling Zhang, Ke-Jia Chen