Sciweavers

325 search results - page 56 / 65
» Hamilton cycles in random graphs and directed graphs
Sort
View
AINA
2007
IEEE
14 years 1 months ago
Depth-Latency Tradeoffs in Multicast Tree Algorithms
The construction of multicast trees is complicated by the need to balance a number of important objectives, including: minimizing latencies, minimizing depth/hops, and bounding th...
Michael T. Helmick, Fred S. Annexstein
ICCV
2009
IEEE
15 years 14 days ago
Correlated Probabilistic Trajectories for Pedestrian Motion Detection
This paper introduces an algorithm for detecting walking motion using point trajectories in video sequences. Given a number of point trajectories, we identify those which are sp...
Frank Perbet, Atsuto Maki, Bjorn Stenger
ICASSP
2009
IEEE
14 years 2 months ago
A compressive sensing approach to object-based surveillance video coding
This paper studies the feasibility and investigates various choices in the application of compressive sensing (CS) to object-based surveillance video coding. The residual object e...
Divya Venkatraman, Anamitra Makur
IROS
2007
IEEE
148views Robotics» more  IROS 2007»
14 years 1 months ago
Tractable probabilistic models for intention recognition based on expert knowledge
— Intention recognition is an important topic in human-robot cooperation that can be tackled using probabilistic model-based methods. A popular instance of such methods are Bayes...
Oliver C. Schrempf, David Albrecht, Uwe D. Hanebec...
CN
2006
98views more  CN 2006»
13 years 7 months ago
Internet resiliency to attacks and failures under BGP policy routing
We investigate the resiliency of the Internet at the Autonomous System (AS) level to failures and attacks, under the real constraint of business agreements between the ASs. The ag...
Danny Dolev, Sugih Jamin, Osnat Mokryn, Yuval Shav...