Sciweavers

3708 search results - page 377 / 742
» Approximating Betweenness Centrality
Sort
View
IJCNN
2006
IEEE
16 years 24 days ago
Bi-directional Modularity to Learn Visual Servoing Tasks
— This paper shows the advantage of using neural network modularity over conventional learning schemes to approximate complex functions. Indeed, it is difficult for artificial ...
Gilles Hermann, Patrice Wira, Jean-Philippe Urban
INFOCOM
2006
IEEE
16 years 24 days ago
A Statistical Framework for Intrusion Detection in Ad Hoc Networks
— We focus on detecting intrusions in ad hoc networks using the misuse detection technique. We allow for detection modules that periodically fail to detect attacks and also gener...
Dhanant Subhadrabandhu, Saswati Sarkar, Farooq Anj...
NETGAMES
2006
ACM
16 years 22 days ago
Comparing interest management algorithms for massively multiplayer games
Broadcasting all state changes to every player of a massively multiplayer game is not a viable solution. To successfully overcome the challenge of scale, massively multiplayer gam...
Jean-Sébastien Boulanger, Jörg Kienzle...
ESA
2005
Springer
105views Algorithms» more  ESA 2005»
16 years 9 days ago
Matching Point Sets with Respect to the Earth Mover's Distance
Let A and B be two sets of m resp. n weighted points in the plane, with m ≤ n. We present (1 + ) and (2+ )-approximation algorithms for the minimum Euclidean Earth Mover’s Dis...
Sergio Cabello, Panos Giannopoulos, Christian Knau...
IDEAL
2005
Springer
16 years 8 days ago
Bearing Similarity Measures for Self-organizing Feature Maps
The neural representation of space in rats has inspired many navigation systems for robots. In particular, Self-Organizing (Feature) Maps (SOM) are often used to give a sense of lo...
Narongdech Keeratipranon, Frédéric M...