Sciweavers

352 search results - page 60 / 71
» A local search approximation algorithm for k-means clusterin...
Sort
View
ESANN
2004
14 years 11 months ago
Neural dynamics for task-oriented grouping of communicating agents
Abstract. Many real world problems are given in the form of multiple measurements comprising local descriptions or tasks. We propose that a dynamical organization of a population o...
Jochen J. Steil
ICMLA
2007
14 years 11 months ago
Scalable optimal linear representation for face and object recognition
Optimal Component Analysis (OCA) is a linear method for feature extraction and dimension reduction. It has been widely used in many applications such as face and object recognitio...
Yiming Wu, Xiuwen Liu, Washington Mio
WOWMOM
2005
ACM
240views Multimedia» more  WOWMOM 2005»
15 years 3 months ago
An Adaptive Routing Protocol for Ad Hoc Peer-to-Peer Networks
Ad hoc networks represent a key factor in the evolution of wireless communications. These networks typically consist of equal nodes that communicate without central control, inter...
Luca Gatani, Giuseppe Lo Re, Salvatore Gaglio
IPPS
2008
IEEE
15 years 4 months ago
SNAP, Small-world Network Analysis and Partitioning: An open-source parallel graph framework for the exploration of large-scale
We present SNAP (Small-world Network Analysis and Partitioning), an open-source graph framework for exploratory study and partitioning of large-scale networks. To illustrate the c...
David A. Bader, Kamesh Madduri
NLP
2000
15 years 1 months ago
Monte-Carlo Sampling for NP-Hard Maximization Problems in the Framework of Weighted Parsing
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
Jean-Cédric Chappelier, Martin Rajman