Sciweavers

461 search results - page 50 / 93
» Bounds for Validation
Sort
View
IPMI
2005
Springer
14 years 4 months ago
Fundamental Limits in 3D Landmark Localization
This work analyses the accuracy of estimating the location of 3D landmarks and characteristic image structures. Based on nonlinear estimation theory we study the minimal stochastic...
Karl Rohr
TCOM
2010
109views more  TCOM 2010»
13 years 9 months ago
Results on Finite Wireless Networks on a Line
Abstract— Today, due to the vast amount of literature on largescale wireless networks, we have a fair understanding of the asymptotic behavior of such networks. However, in real ...
Ali Eslami, Mohammad Nekoui, Hossein Pishro-Nik
CORR
2010
Springer
342views Education» more  CORR 2010»
13 years 8 months ago
Canonizable Partial Order Generators
In a previous work we introduced slice graphs as a way to specify both infinite languages of directed acyclic graphs (DAGs) and infinite languages of partial orders. Therein we fo...
Mateus de Oliveira Oliveira
STOC
2009
ACM
99views Algorithms» more  STOC 2009»
14 years 11 months ago
Testing juntas nearly optimally
A function on n variables is called a k-junta if it depends on at most k of its variables. In this article, we show that it is possible to test whether a function is a k-junta or ...
Eric Blais
ICS
2007
Tsinghua U.
14 years 5 months ago
Sensitivity analysis for automatic parallelization on multi-cores
Sensitivity Analysis (SA) is a novel compiler technique that complements, and integrates with, static automatic parallelization analysis for the cases when relevant program behavi...
Silvius Rus, Maikel Pennings, Lawrence Rauchwerger