Sciweavers

3656 search results - page 3 / 732
» Compact Location Problems
Sort
View
TKDE
2008
141views more  TKDE 2008»
13 years 5 months ago
Location Fingerprinting In A Decorrelated Space
We present a novel approach to the problem of the indoor localization in wireless environments. The main contribution of this paper is four folds: (a) We show that, by projecting t...
Shih-Hau Fang, Tsung-Nan Lin, Po-Chiang Lin
PLDI
2009
ACM
14 years 6 months ago
Efficiently and precisely locating memory leaks and bloat
Inefficient use of memory, including leaks and bloat, remain a significant challenge for C and C++ developers. Applications with these problems become slower over time as their wo...
Gene Novark, Emery D. Berger, Benjamin G. Zorn
JSYML
2000
76views more  JSYML 2000»
13 years 5 months ago
Located Sets and Reverse Mathematics
Let X be a compact metric space. A closed set K X is located if the distance function d(x, K) exists as a continuous realvalued function on X; weakly located if the predicate d(x,...
Mariagnese Giusto, Stephen G. Simpson
JAC
2008
13 years 7 months ago
Study of the NP-completeness of the compact table problem
The problem of compact tables is to maximise the overlap when building a word that is to include permutations of every given words (all the words being the same length). This probl...
Jean-Christophe Dubacq, Jean-Yves Moyen
4OR
2007
103views more  4OR 2007»
13 years 5 months ago
Compact linearization for binary quadratic problems
Abstract We show that a well-known linearization technique initially proposed for quadratic assignment problems can be generalized to a broader class of quadratic 0-1 mixed-integer...
Leo Liberti