Sciweavers

138 search results - page 8 / 28
» Hardness of fully dense problems
Sort
View
ECCV
2006
Springer
14 years 9 months ago
A Multiview Approach to Tracking People in Crowded Scenes Using a Planar Homography Constraint
Occlusion and lack of visibility in dense crowded scenes make it very difficult to track individual people correctly and consistently. This problem is particularly hard to tackle i...
Saad M. Khan, Mubarak Shah
ICML
2005
IEEE
14 years 8 months ago
Fast inference and learning in large-state-space HMMs
For Hidden Markov Models (HMMs) with fully connected transition models, the three fundamental problems of evaluating the likelihood of an observation sequence, estimating an optim...
Sajid M. Siddiqi, Andrew W. Moore
MASCOTS
2010
13 years 6 months ago
Cluster-Based Correlated Data Gathering in Wireless Sensor Networks
—We consider the problem of optimal cluster-based data gathering in Wireless Sensor Networks (WSNs) when nearby readings are spatially correlated. Due to the dense nature of WSNs...
Ali Dabirmoghaddam, Majid Ghaderi, Carey L. Willia...
INFOCOM
2000
IEEE
14 years 8 days ago
Optimal Partition of QoS requirements with Discrete Cost Functions
Abstract—The future Internet is expected to support applications with quality of service (QoS) requirements. For this end several mechanisms are suggested in the IETF to support ...
Danny Raz, Yuval Shavitt
ECCV
2006
Springer
13 years 11 months ago
SIFT and Shape Context for Feature-Based Nonlinear Registration of Thoracic CT Images
Nonlinear image registration is a prerequisite for various medical image analysis applications. Many data acquisition protocols suffer from problems due to breathing motion which h...
Martin Urschler, Joachim Bauer, Hendrik Ditt, Hors...