2333 search results - page 66 / 467 » Recursive Computational Depth |
70
Voted
ISCAS
2006
IEEE
15 years 6 months ago
2006
IEEE
— a form-preserving 2D z-domain helix transform is proposed for the synthesis of computable practical-BIBO stable 2D recursive filters computed over uniformly-spaced circular inp...
98
Voted
ICALP
2009
Springer
16 years 26 days ago
2009
Springer
In this paper, we show that for every constant 0 < < 1/2 and for every constant d 2, the minimum size of a depth d Boolean circuit that -approximates Majority function on n ...
ICALP
2007
Springer
15 years 6 months ago
2007
Springer
A data tree is a tree where each node has a label from a finite set, and a data value from a possibly infinite set. We consider data trees whose depth is bounded beforehand. By d...
92
Voted
ICANN
2001
Springer
15 years 5 months ago
2001
Springer
Abstract. It has remained an open question whether there exist product unit networks with constant depth that have superlinear VC dimension. In this paper we give an answer by cons...
96
Voted
ICCV
2007
IEEE
16 years 2 months ago
2007
IEEE
Thanks to recent progress in category-level object recognition, we have now come to a point where these techniques have gained sufficient maturity and accuracy to succesfully feed...