Sciweavers

461 search results - page 25 / 93
» Bounds for Validation
Sort
View
ENDM
2010
105views more  ENDM 2010»
13 years 11 months ago
Minimizing Expected Attacking Cost in Networks
A branch-and-bound algorithm is devised to determine the optimal attack strategy to disconnect a network where the objective is to minimize the expected attacking cost. The attack...
Anis Gharbi, Mohamed Naceur Azaiez, Mohamed Kharbe...
GLOBECOM
2007
IEEE
14 years 5 months ago
Performance Analysis of V-BLAST with Optimum Power Allocation
—Comprehensive performance analysis of the unordered V-BLAST algorithm with various power allocation strategies is presented, which makes use of analytical tools and resorts to M...
Victoria Kostina, Sergey Loyka
COLT
2000
Springer
14 years 2 months ago
The Role of Critical Sets in Vapnik-Chervonenkis Theory
In the present paper, we present the theoretical basis, as well as an empirical validation, of a protocol designed to obtain effective VC dimension estimations in the case of a si...
Nicolas Vayatis
ICRA
2009
IEEE
149views Robotics» more  ICRA 2009»
14 years 5 months ago
On achievable accuracy for pose tracking
Abstract—This paper presents Cramér-Rao bound-like inequalities for pose tracking, which is defined as the problem of recovering the robot displacement given two successive rea...
Andrea Censi
COMBINATORICA
2008
112views more  COMBINATORICA 2008»
13 years 11 months ago
On the rigidity of molecular graphs
The rigidity of squares of graphs in three-space has important applications to the study of flexibility in molecules. The Molecular Conjecture, posed in 1984 by T-S. Tay and W. Wh...
Bill Jackson, Tibor Jordán