5169 search results - page 169 / 1034 » Locality approximation using time |
129
Voted
GECCO
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. We present upper bounds on the time and space complexity of finding the global optimum of additively separable functions, a class of functions that has been studied exten...
267
click to vote
ICDE
2009
IEEE
16 years 6 months ago
2009
IEEE
The popularity of location-based services and the need to do real-time processing on them has led to an interest in performing queries on transportation networks, such as finding s...
144
click to vote
CAI
2002
Springer
15 years 4 months ago
2002
Springer
In a localized routing algorithm, node A currently holding the message forwards it based on the location of itself, its neighboring nodes and destination. We propose to use depth ...
122
Voted
ICRA
2003
IEEE
15 years 10 months ago
2003
IEEE
— Mapping an environment with an imaging sensor becomes very challenging if the environment to be mapped is unknown and has to be explored. Exploration involves the planning of v...
143
click to vote
CVPR
2005
IEEE
15 years 10 months ago
2005
IEEE
We introduce a new method that characterizes typical local image features (e.g., SIFT [9], phase feature [3]) in terms of their distinctiveness, detectability, and robustness to i...