5169 search results - page 27 / 1034 » Locality approximation using time |
COMGEO
2004
ACM
13 years 7 months ago
2004
ACM
In k-means clustering we are given a set of n data points in d-dimensional space d and an integer k, and the problem is to determine a set of k points in d , called centers, to mi...
TROB
2010
13 years 5 months ago
2010
Abstract—Localization, which is the determination of one’s location in a known terrain, is a fundamental task for autonomous robots. This paper presents several new basic theor...
ICDE
2012
IEEE
11 years 9 months ago
2012
IEEE
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
COCOON
2001
Springer
13 years 12 months ago
2001
Springer
We consider generalized discrete timed automata with general linear relations over clocks and parameterized constants as clock constraints and with parameterized durations. We look...
PODC
2005
ACM
14 years 28 days ago
2005
ACM
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...