Sciweavers

229 search results - page 3 / 46
» Proving Bounds on Real-Valued Functions with Computations
Sort
View
CLEAR
2007
Springer
208views Biometrics» more  CLEAR 2007»
14 years 5 months ago
Head Orientation Estimation Using Particle Filtering in Multiview Scenarios
Abstract. This paper presents a novel approach to the problem of determining head pose estimation and face 3D orientation of several people in low resolution sequences from multipl...
Cristian Canton-Ferrer, Josep R. Casas, Montse Par...
CORR
2010
Springer
82views Education» more  CORR 2010»
13 years 8 months ago
Computing (or not) Quasi-Periodicity Functions of Tilings
Abstract. We know that tilesets that can tile the plane always admit a quasiperiodic tiling [4, 8], yet they hold many uncomputable properties [3, 11, 21, 25]. The quasi-periodicit...
Alexis Ballier, Emmanuel Jeandel
ECCC
2010
117views more  ECCC 2010»
13 years 9 months ago
Nearly Tight Bounds for Testing Function Isomorphism
We study the problem of testing isomorphism (equivalence up to relabelling of the variables) of two Boolean functions f, g : {0, 1}n → {0, 1}. Our main focus is on the most stud...
Sourav Chakraborty, David García-Soriano, A...
JC
2011
87views more  JC 2011»
13 years 5 months ago
Lower bounds for the complexity of linear functionals in the randomized setting
Abstract. Hinrichs [3] recently studied multivariate integration defined over reproducing kernel Hilbert spaces in the randomized setting and for the normalized error criterion. I...
Erich Novak, Henryk Wozniakowski
FOCS
1991
IEEE
14 years 2 months ago
Lower Bounds for the Complexity of Reliable Boolean Circuits with Noisy Gates
We prove that the reliable computation of any Boolean function with sensitivity s requires Ω(s log s) gates if the gates of the circuit fail independently with a fixed positive...
Anna Gál