1756 search results - page 97 / 352 » Mapping Small Worlds |
124
click to vote
ICALP
2003
Springer
15 years 9 months ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
144
Voted
EWSN
2010
Springer
16 years 1 months ago
2010
Springer
The proliferation of sensors in devices of frequent use, such as mobile phones, offers unprecedented opportunities for forming selfselected communities around shared sensory data ...
147
click to vote
ALT
2004
Springer
16 years 1 months ago
2004
Springer
Kernel functions are typically viewed as providing an implicit mapping of points into a high-dimensional space, with the ability to gain much of the power of that space without inc...
180
click to vote
ESANN
2006
15 years 5 months ago
2006
The Self-Organizing map (SOM), a powerful method for data mining and cluster extraction, is very useful for processing data of high dimensionality and complexity. Visualization met...
123
click to vote
ATAL
2008
Springer
15 years 6 months ago
2008
Springer
The exploration problem is a central issue in mobile robotics. A complete terrain coverage is not practical if the environment is large with only a few small hotspots. This paper ...