Sciweavers

1101 search results - page 128 / 221
» An Algorithm for the Graph Crossing Number Problem
Sort
View
ICC
2007
IEEE
192views Communications» more  ICC 2007»
15 years 11 months ago
Informed Dynamic Scheduling for Belief-Propagation Decoding of LDPC Codes
— Low-Density Parity-Check (LDPC) codes are usually decoded by running an iterative belief-propagation, or message-passing, algorithm over the factor graph of the code. The tradi...
Andres I. Vila Casado, Miguel Griot, Richard D. We...
CP
2011
Springer
14 years 4 months ago
Pseudo-Tree-Based Incomplete Algorithm for Distributed Constraint Optimization with Quality Bounds
A Distributed Constraint Optimization Problem (DCOP) is a fundamental problem that can formalize various applications related to multi-agent cooperation. Since it is NP-hard, consi...
Tenda Okimoto, Yongjoon Joe, Atsushi Iwasaki, Mako...
CVPR
2006
IEEE
15 years 11 months ago
Active Graph Cuts
This paper adds a number of novel concepts into global s/t cut methods improving their efficiency and making them relevant for a wider class of applications in vision where algor...
Olivier Juan, Yuri Boykov
ICOST
2007
Springer
15 years 11 months ago
Tracking People in Indoor Environments
Tracking the movement of people in indoor environments is useful for a variety of applications including elderly care, study of shopper behavior in shopping centers, security etc. ...
Candy Yiu, Suresh Singh
124
Voted
AIA
2007
15 years 6 months ago
Incremental classifier based on a local credibility criterion
In this paper we propose the Local Credibility Concept (LCC), a novel technique for incremental classifiers. It measures the classification rate of the classifier’s local mod...
Herward Prehn, Gerald Sommer