3415 search results - page 125 / 683 » Lower Bounds for Kernelizations |
106
click to vote
ECCV
2002
Springer
16 years 6 months ago
2002
Springer
Estimating the parameters of a pencil of lines is addressed. A statistical model for the measurements is developed, from which the Cramer Rao lower bound is determined. An estimato...
121
click to vote
ADCM
2008
15 years 3 months ago
2008
We derive upper and lower bounds on the dimensions of trivariate spline spaces defined on tetrahedral partitions. The results hold for general partitions, and for all degrees of sm...
130
click to vote
SIAMSC
2008
15 years 4 months ago
2008
This paper discusses both the theoretical and statistical errors obtained by various well-known dot products, from the canonical to pairwise algorithms, and introduces a new and mo...
257
click to vote
ASUNAM
2011
IEEE
14 years 4 months ago
2011
IEEE
—With the rise of network science as an exciting interdisciplinary research topic, efficient graph algorithms are in high demand. Problematically, many such algorithms measuring...
115
click to vote
COMPGEOM
2010
ACM
15 years 9 months ago
2010
ACM
We present two new fundamental lower bounds on the worst-case combinatorial complexity of sets of free lines and sets of maximal free line segments in the presence of balls in thr...