Sciweavers

2531 search results - page 27 / 507
» Group testing in graphs
Sort
View
IVC
2008
223views more  IVC 2008»
13 years 10 months ago
Euclidean path modeling for video surveillance
In this paper, we address the issue of Euclidean path modeling in a single camera for activity monitoring in a multi-camera video surveillance system. The method consists of a pat...
Imran N. Junejo, Hassan Foroosh
JSC
2010
132views more  JSC 2010»
13 years 8 months ago
Binary codes from the line graph of the n-cube
We examine designs and binary codes associated with the line graph of the n-cube Qn, i.e. the Hamming graph H(n, 2). We find the automorphism groups and the parameters of the cod...
W. Fish, Jennifer D. Key, E. Mwambene
APPROX
2008
Springer
75views Algorithms» more  APPROX 2008»
14 years 11 days ago
On the Query Complexity of Testing Orientations for Being Eulerian
We consider testing directed graphs for being Eulerian in the orientation model introduced in [15]. Despite the local nature of the property of being Eulerian, it turns out to be ...
Eldar Fischer, Oded Lachish, Ilan Newman, Arie Mat...
ICCAD
1999
IEEE
84views Hardware» more  ICCAD 1999»
14 years 2 months ago
Improving coverage analysis and test generation for large designs
State space techniques have proven to be useful for measuring and improving the coverage of test vectors that are used during functional validation via simulation. By comparing th...
Jules P. Bergmann, Mark Horowitz
DAC
2009
ACM
14 years 11 months ago
Mode grouping for more effective generalized scheduling of dynamic dataflow applications
For a number of years, dataflow concepts have provided designers of digital signal processing systems with environments capable of expressing high-level software architectures as ...
William Plishker, Nimish Sane, Shuvra S. Bhattacha...