Sciweavers

545 search results - page 107 / 109
» Estimating the Probability of Approximate Matches
Sort
View
ETT
2002
89views Education» more  ETT 2002»
13 years 7 months ago
Delay analysis of a probabilistic priority discipline
In computer networks, the Strict Priority (SP) discipline is perhaps the most common and simplest method to schedule packets from different classes of applications, each with diver...
Yuming Jiang, Chen-Khong Tham, Chi Chung Ko
SIGMETRICS
2002
ACM
13 years 7 months ago
Quality of service evaluations of multicast streaming protocols
Recently proposed scalable on-demand streaming protocols have previously been evaluated using a system cost measure termed the "required server bandwidth". For the scala...
Haonan Tan, Derek L. Eager, Mary K. Vernon, Hongfe...
PRL
2007
138views more  PRL 2007»
13 years 6 months ago
Ent-Boost: Boosting using entropy measures for robust object detection
Recently, boosting has come to be used widely in object-detection applications because of its impressive performance in both speed and accuracy. However, learning weak classifier...
Duy-Dinh Le, Shin'ichi Satoh
ICRA
2010
IEEE
138views Robotics» more  ICRA 2010»
13 years 5 months ago
Rao-Blackwellized particle filtering for probing-based 6-DOF localization in robotic assembly
This paper presents a probing-based method for probabilistic localization in automated robotic assembly. We consider peg-in-hole problems in which a needle-like peg has a single p...
Yuichi Taguchi, Tim K. Marks, Haruhisa Okuda
CVPR
2011
IEEE
13 years 2 months ago
Tracking 3D Human Pose with Large Root Node Uncertainty
Representing articulated objects as a graphical model has gained much popularity in recent years, often the root node of the graph describes the global position and orientation of...
Ben Daubney, Xianghua Xie