Sciweavers

5624 search results - page 261 / 1125
» On Conditional Covering Problem
Sort
View
SODA
2012
ACM
217views Algorithms» more  SODA 2012»
13 years 9 months ago
Deterministic construction of an approximate M-ellipsoid and its applications to derandomizing lattice algorithms
We give a deterministic O(log n)n -time and space algorithm for the Shortest Vector Problem (SVP) of a lattice under any norm, improving on the previous best deterministic nO(n) -...
Daniel Dadush, Santosh Vempala
ICIP
2010
IEEE
15 years 4 months ago
Maximizing intra-individual correlations for illumination-insensitive face recognition
Illumination variation has been one of the most intractable problems in face recognition and many approaches have been proposed to handle illumination problem in the last decades ...
Hu Han, Shiguang Shan, Xilin Chen, Wen Gao
CVPR
2012
IEEE
13 years 9 months ago
Multitarget data association with higher-order motion models
We present an iterative approximate solution to the multidimensional assignment problem under general cost functions. The method maintains a feasible solution at every step, and i...
Robert T. Collins
CHI
2006
ACM
16 years 7 months ago
A study of the use of mobile phones by older persons
This paper reports on issues related to the use of mobile phones by older people. This study uses triangulation, a mixed method of qualitative (focus group discussions) and quanti...
Sri Hastuti Kurniawan, Murni Mahmud, Yanuar Nugroh...
ICRA
2008
IEEE
129views Robotics» more  ICRA 2008»
16 years 1 months ago
Incremental spectral clustering and seasons: Appearance-based localization in outdoor environments
— The problem of appearance-based mapping and navigation in outdoor environments is far from trivial. In this paper, an appearance-based topological map, covering a large, mixed ...
Christoffer Valgren, Achim J. Lilienthal