Sciweavers

2657 search results - page 119 / 532
» On the complexity of hierarchical problem solving
Sort
View
94
Voted
CVPR
2006
IEEE
15 years 7 months ago
Joint Recognition of Complex Events and Track Matching
We present a novel method for jointly performing recognition of complex events and linking fragmented tracks into coherent, long-duration tracks. Many event recognition methods re...
Michael T. Chan, Anthony Hoogs, Rahul Bhotika, A. ...
123
Voted
JSAC
2011
116views more  JSAC 2011»
14 years 8 months ago
Low Complexity Outage Optimal Distributed Channel Allocation for Vehicle-to-Vehicle Communications
—Due to the potential of enhancing traffic safety, protecting environment, and enabling new applications, vehicular communications, especially vehicle-to-vehicle (V2V) communica...
Bo Bai, Wei Chen, Khaled Ben Letaief, Zhigang Cao
IJSI
2010
84views more  IJSI 2010»
15 years 2 days ago
Computational Complexity and Anytime Algorithm for Inconsistency Measurement
Measuring inconsistency degrees of inconsistent knowledge bases is an important problem as it provides context information for facilitating inconsistency handling. Many methods hav...
Yue Ma, Guilin Qi, Guohui Xiao, Pascal Hitzler, Zu...
ATAL
2008
Springer
15 years 3 months ago
Evaluating the performance of DCOP algorithms in a real world, dynamic problem
Complete algorithms have been proposed to solve problems modelled as distributed constraint optimization (DCOP). However, there are only few attempts to address real world scenari...
Robert Junges, Ana L. C. Bazzan
ICASSP
2010
IEEE
15 years 1 months ago
Gradient Polytope Faces Pursuit for large scale sparse recovery problems
Polytope Faces Pursuit is a greedy algorithm that performs Basis Pursuit with similar order complexity to Orthogonal Matching Pursuit. The algorithm adds one basis vector at a tim...
Aris Gretsistas, Ivan Damnjanovic, Mark D. Plumble...