4894 search results - page 548 / 979 » The Guarding Problem - Complexity and Approximation |
118
click to vote
SIAMSC
2008
15 years 4 months ago
2008
In this paper we present a new incomplete factorization of a square matrix into triangular factors in which we get standard LU or LDLT factors (direct factors) and their inverses (...
114
click to vote
MOC
2000
15 years 4 months ago
2000
Let {Sm} be an infinite sequence whose limit or antilimit S can be approximated very efficiently by applying a suitable extrapolation method E0 to {Sm}. Assume that the Sm and henc...
144
Voted
JAT
2010
15 years 3 months ago
2010
We consider H¨older smoothness classes of surfaces for which we construct piecewise polynomial approximation networks, which are graphs with polynomial pieces as nodes and edges ...
149
Voted
DCOSS
2011
Springer
14 years 4 months ago
2011
Springer
—Sensor networks are often redundant by design; this is often done in order to achieve reliability in information processing. In many cases, the redundancy relationships between ...
193
click to vote
TKDE
2012
13 years 7 months ago
2012
—Traditional clustering techniques are inapplicable to problems where the relationships between data points evolve over time. Not only is it important for the clustering algorith...