4894 search results - page 256 / 979 » The Guarding Problem - Complexity and Approximation |
174
click to vote
MOC
2000
15 years 6 months ago
2000
How close are Galerkin eigenvectors to the best approximation available out of the trial subspace? Under a variety of conditions the Galerkin method gives an approximate eigenvecto...
194
click to vote
CDC
2010
IEEE
15 years 1 months ago
2010
IEEE
This paper considers consensus problems with delayed noisy measurements, and stochastic approximation is used to achieve mean square consensus. For stochastic approximation based c...
244
click to vote
COCOON
2010
Springer
15 years 5 months ago
2010
Springer
The problem of sorting permutations by double-cut-and-joins (SBD) arises when we perform the double-cut-and-join (DCJ) operations on pairs of unichromosomal genomes without the gen...
183
click to vote
FQAS
2009
Springer
16 years 1 months ago
2009
Springer
We consider the problem of finding and ranking paths in semistructured data without necessarily knowing its full structure. The query language we adopt comprises conjunctions of r...
171
click to vote
VTC
2008
IEEE
16 years 29 days ago
2008
IEEE
—The concept of Virtual Antenna Array (VAA) is a promising approach to apply MIMO concepts in relaying systems. In order to fulfill a given Quality-of-Service (QoS) requirement ...