Sciweavers

1554 search results - page 154 / 311
» Parameterized Complexity and Approximation Algorithms
Sort
View
131
Voted
SGP
2007
15 years 5 months ago
Focal surfaces of discrete geometry
The differential geometry of smooth three-dimensional surfaces can be interpreted from one of two perspectives: in terms of oriented frames located on the surface, or in terms of ...
Jingyi Yu, Xiaotian Yin, Xianfeng Gu, Leonard McMi...
165
Voted
CORR
2011
Springer
142views Education» more  CORR 2011»
14 years 7 months ago
Taming Numbers and Durations in the Model Checking Integrated Planning System
The Model Checking Integrated Planning System (MIPS) has shown distinguished performance in the second and third international planning competitions. With its object-oriented fram...
Stefan Edelkamp
MOBIHOC
2008
ACM
16 years 3 months ago
Self-monitoring for sensor networks
Local monitoring is an effective mechanism for the security of wireless sensor networks (WSNs). Existing schemes assume the existence of sufficient number of active nodes to carry...
Dezun Dong, Yunhao Liu, Xiangke Liao
ICALP
2005
Springer
15 years 9 months ago
Facility Location in Sublinear Time
Abstract. In this paper we present a randomized constant factor approximation algorithm for the problem of computing the optimal cost of the metric Minimum Facility Location proble...
Mihai Badoiu, Artur Czumaj, Piotr Indyk, Christian...
114
Voted
ISSAC
2009
Springer
144views Mathematics» more  ISSAC 2009»
15 years 10 months ago
H-LLL: using householder inside LLL
We describe a new LLL-type algorithm, H-LLL, that relies on Householder transformations to approximate the underlying Gram-Schmidt orthogonalizations. The latter computations are ...
Ivan Morel, Damien Stehlé, Gilles Villard