Search Sciweavers | Sciweavers

291 search results - page 4 / 59

» Approximate centerpoints with proofs

click to vote

ALGOSENSORS
2010
Springer

213views Sensor Networks» more ALGOSENSORS 2010»

Lifetime Maximization of Monitoring Sensor Networks

13 years 9 months ago

Download algo2.iti.kit.edu

We study the problem of maximizing the lifetime of a sensor network assigned to monitor a given area. Our main result is a linear time dual approximation algorithm that comes arbit...

Peter Sanders, Dennis Schieferdecker

claim paper

Read More »

click to vote

ICRA
2005
IEEE

114views Robotics» more ICRA 2005»

A Proof for the Approximate Sparsity of SLAM Information Matrices

14 years 4 months ago

Download www.informatik.uni-bremen.de

— For the Simultaneous Localization and Mapping problem several efﬁcient algorithms have been proposed that make use of a sparse information matrix representation (e.g. SEIF, T...

Udo Frese

claim paper

Read More »

click to vote

MFCS
1998
Springer

89views Theoretical Computer Science» more MFCS 1998»

Minimum Propositional Proof Length is NP-Hard to Linearly Approximate

14 years 2 months ago

Download math.ucsd.edu

Michael Alekhnovich, Samuel R. Buss, Shlomo Moran,...

claim paper

Read More »

click to vote

FOCS
1992
IEEE

133views Theoretical Computer Science» more FOCS 1992»

Proof Verification and Hardness of Approximation Problems

14 years 1 months ago

Download people.csail.mit.edu

The class PCP(f(n), g(n)) consists of all languages L for which there exists a polynomial-time probabilistic oracle machine that uses O(f(n)) random bits, queries O(g(n)) bits of ...

Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu...

claim paper

Read More »

click to vote

ORL
2006

85views more ORL 2006»

A simple proof of diffusion approximations for LBFS re-entrant lines

13 years 10 months ago

Download madis1.iss.ac.cn

For a re-entrant line operating under the last-buffer

Jiankui Yang, J. G. Dai, Jian-Gong You, Hanqin Zha...

claim paper