736 search results - page 28 / 148 » Approximating the Number of Network Motifs |
193
click to vote
IJCV
2012
13 years 8 months ago
2012
Abstract We tackle the problem of detecting occluded regions in a video stream. Under assumptions of Lambertian reflection and static illumination, the task can be posed as a vari...
148
click to vote
GLOBECOM
2006
IEEE
16 years 3 days ago
2006
IEEE
In this letter we develop an expression for the approximate throughput guarantee violation probability (TGVP) for users in time-slotted networks for any scheduling algorithm with ...
151
click to vote
RANDOM
2001
Springer
15 years 10 months ago
2001
Springer
We study integrated prefetching and caching in single and parallel disk systems. A recent approach used linear programming to solve the problem. We show that integrated prefetching...
158
click to vote
COLT
1993
Springer
15 years 10 months ago
1993
Springer
We consider the problem of learning in multilayer feed-forward networks of linear threshold units. We show that the Vapnik-Chervonenkis dimension of the class of functions that ca...
154
click to vote
COMCOM
2004
15 years 5 months ago
2004
This paper investigates mobile communication networks consisting of N-cells in tandem. Two models with fixed channel assignment are considered, which correspond to (A) a uni-direc...