Sciweavers

1566 search results - page 145 / 314
» On a Cone Covering Problem
Sort
View
ISAAC
2010
Springer
226views Algorithms» more  ISAAC 2010»
15 years 2 months ago
On Tractable Cases of Target Set Selection
We study the NP-complete TARGET SET SELECTION (TSS) problem occurring in social network analysis. Complementing results on its approximability and extending results for its restric...
André Nichterlein, Rolf Niedermeier, Johann...
SODA
2012
ACM
217views Algorithms» more  SODA 2012»
13 years 7 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
CHI
2006
ACM
16 years 5 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»
15 years 11 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
ER
2007
Springer
173views Database» more  ER 2007»
15 years 10 months ago
Cost-Based Fragmentation for Distributed Complex Value Databases
The major purpose of the design of distributed databases is to improve system performance and to increase system reliability. Fragmentation and allocation play important roles in t...
Hui Ma, Markus Kirchberg