Sciweavers

1469 search results - page 67 / 294
» Approximate polynomial decomposition
Sort
View
FOCS
1998
IEEE
15 years 2 months ago
The Shortest Vector in a Lattice is Hard to Approximate to Within Some Constant
We show that approximating the shortest vector problem (in any p norm) to within any constant factor less than p 2 is hard for NP under reverse unfaithful random reductions with i...
Daniele Micciancio
CDC
2008
IEEE
144views Control Systems» more  CDC 2008»
14 years 11 months ago
Controllability decompositions of networked systems through quotient graphs
In this paper we study decentralized, networked systems whose interaction dynamics are given by a nearestneighbor averaging rule. By letting one node in the network take on the rol...
Simone Martini, Magnus Egerstedt, Antonio Bicchi
JCPHY
2011
104views more  JCPHY 2011»
14 years 21 days ago
Gaussian beam decomposition of high frequency wave fields using expectation-maximization
A new numerical method for approximating highly oscillatory wave fields as a superposition of Gaussian beams is presented. The method estimates the number of beams and their para...
Gil Ariel, Björn Engquist, Nicolay M. Tanushe...
CORR
2011
Springer
192views Education» more  CORR 2011»
14 years 4 months ago
On cooperative patrolling: optimal trajectories, complexity analysis, and approximation algorithms
—The subject of this work is the patrolling of an environment with the aid of a team of autonomous agents. We consider both the design of open-loop trajectories with optimal prop...
Fabio Pasqualetti, Antonio Franchi, Francesco Bull...
MOC
2000
77views more  MOC 2000»
14 years 9 months ago
Locking-free finite elements for the Reissner-Mindlin plate
Two new families of Reissner-Mindlin triangular finite elements are analyzed. One family, generalizing an element proposed by Zienkiewicz and Lefebvre, approximates (for k 1) the ...
Richard S. Falk, Tong Tu