Sciweavers

3044 search results - page 148 / 609
» Linear logical approximations
Sort
View
COMPGEOM
2003
ACM
14 years 3 months ago
Shape fitting with outliers
Given a set H of n hyperplanes in IRd , we present an algorithm that ε-approximates the extent between the top and bottom k levels of the arrangement of H in time O(n+(k/ε)c), w...
Sariel Har-Peled, Yusu Wang
ESA
2001
Springer
145views Algorithms» more  ESA 2001»
14 years 2 months ago
Grouping Techniques for Scheduling Problems: Simpler and Faster
In this paper we describe a general grouping technique to devise faster and simpler approximation schemes for several scheduling problems. We illustrate the technique on two diff...
Aleksei V. Fishkin, Klaus Jansen, Monaldo Mastroli...
CDC
2009
IEEE
138views Control Systems» more  CDC 2009»
14 years 2 months ago
Semidefinite programming methods for system realization and identification
We describe semidefinite programming methods for system realization and identification. For each of these two applications, a variant of a simple subspace algorithm is presented, i...
Zhang Liu, Lieven Vandenberghe
ALGOSENSORS
2010
Springer
13 years 9 months ago
Lifetime Maximization of Monitoring Sensor Networks
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
ISSE
2007
13 years 10 months ago
Specifying real-time properties in autonomic systems
Increasingly, computer software must adapt dynamically to changing conditions. The correctness of adaptation cannot be rigorously addressed without precisely specifying the require...
Ji Zhang, Zhinan Zhou, Betty H. C. Cheng, Philip K...