3656 search results - page 16 / 732 » Compact Location Problems |
ORL
1998
13 years 9 months ago
1998
This paper presents a simple procedure for accelerating convergence in a generalized Fermat–Weber problem with lp distances. The main idea is to multiply the predetermined step ...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
We discuss how phase-transitions may be detected in computationally hard problems in the context of anytime algorithms. Treating the computational time, value and utility functions...
ECCV
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. We address the problem of large scale place-of-interest recognition in cell phone images of urban scenarios. Here, we go beyond what has been shown in earlier approaches ...
VLDB
2000
ACM
14 years 1 months ago
2000
ACM
A range-max query finds the maximum value over all selected cells of an on-line analytical processing (OLAP) data cube where the selection is specified by ranges of contiguous val...
HICSS
2007
IEEE
14 years 4 months ago
2007
IEEE
