Sciweavers

1469 search results - page 171 / 294
» Approximate polynomial decomposition
Sort
View
TSMC
2008
136views more  TSMC 2008»
15 years 6 months ago
On 3-D Point Set Matching With MAE and SAE Cost Criteria
This paper deals with the problem of optimally matching two ordered sets of 3-D points by means of a rigid displacement. Contrary to the standard approach, where a sumof-squared-er...
Giuseppe C. Calafiore
MOC
2000
97views more  MOC 2000»
15 years 6 months ago
Convergence rates to the discrete travelling wave for relaxation schemes
Abstract. This paper is concerned with the asymptotic convergence of numerical solutions toward discrete travelling waves for a class of relaxation numerical schemes, approximating...
Hailiang Liu
CORR
2010
Springer
105views Education» more  CORR 2010»
15 years 5 months ago
The Networked Common Goods Game
Abstract. We introduce a new class of games called the networked common goods game (NCGG), which generalizes the well-known common goods game [12]. We focus on a fairly general sub...
Jinsong Tan
CORR
2011
Springer
181views Education» more  CORR 2011»
15 years 1 months ago
On Isolating Points Using Disks
In this paper, we consider the problem of choosing disks (that we can think of as corresponding to wireless sensors) so that given a set of input points in the plane, there exists ...
Matt Gibson, Gaurav Kanade, Kasturi R. Varadarajan
MOC
2010
15 years 1 months ago
hp-Optimal discontinuous Galerkin methods for linear elliptic problems
Abstract. The aim of this paper is to present and analyze a class of hpversion discontinuous Galerkin (DG) discretizations for the numerical approximation of linear elliptic proble...
Benjamin Stamm, Thomas P. Wihler