Sciweavers

9842 search results - page 429 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
ICASSP
2011
IEEE
14 years 8 months ago
Particle algorithms for filtering in high dimensional state spaces: A case study in group object tracking
We briefly present the current state-of-the-art approaches for group and extended object tracking with an emphasis on particle methods which have high potential to handle complex...
Lyudmila Mihaylova, Avishy Carmi
JMLR
2012
13 years 7 months ago
Multi-label Subspace Ensemble
A challenging problem of multi-label learning is that both the label space and the model complexity will grow rapidly with the increase in the number of labels, and thus makes the...
Tianyi Zhou, Dacheng Tao
LCPC
1997
Springer
15 years 8 months ago
Automatic Data Decomposition for Message-Passing Machines
The data distribution problem is very complex, because it involves trade-offdecisions between minimizing communication and maximizing parallelism. A common approach towards solving...
Mirela Damian-Iordache, Sriram V. Pemmaraju
IAT
2009
IEEE
15 years 8 months ago
Offline Planning for Communication by Exploiting Structured Interactions in Decentralized MDPs
Variants of the decentralized MDP model focus on problems exhibiting some special structure that makes them easier to solve in practice. Our work is concerned with two main issues...
Hala Mostafa, Victor R. Lesser
ASWEC
2006
IEEE
15 years 8 months ago
Requirements Capture and Specification for Enterprise Applications: a UML Based Attempt
We propose a software development method for enterprise applications that combines the use of the structural concepts provided by problem frames, and the use of the UML notation. ...
Christine Choppy, Gianna Reggio