75 search results - page 12 / 15 » Definability of Combinatorial Functions and Their Linear Rec... |
CPC
1999
13 years 8 months ago
1999
Total path length, or search cost, for a rooted tree is defined as the sum of all root-to-node distances. Let Tn be the total path length for a random recursive tree of order n. M...
DASFAA
2010
IEEE
14 years 3 months ago
2010
IEEE
Scalable execution of continuous queries over massive data streams often requires splitting input streams into parallel sub-streams over which query operators are executed in paral...
SIAMAM
2000
13 years 8 months ago
2000
This paper deals with regularized pointwise estimation of discrete signals which contain large strongly homogeneous zones, where typically they are constant, or linear, or more gen...
TIT
2002
13 years 8 months ago
2002
We offer two noiseless codes for blocks of integers Xn = (X1, . . . , Xn). We provide explicit bounds on the relative redundancy that are valid for any distribution F in the class...
CVPR
2006
IEEE
14 years 10 months ago
2006
IEEE
We present a novel discriminative-generative hybrid approach in this paper, with emphasis on application in multiview object detection. Our method includes a novel generative mode...