1477 search results - page 94 / 296 » Complexity of (iterated) dominance |
168
click to vote
ICC
2007
IEEE
16 years 21 days ago
2007
IEEE
— 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...
178
click to vote
HIPEAC
2005
Springer
15 years 12 months ago
2005
Springer
This article aims at making iterative optimization practical and usable by speeding up the evaluation of a large range of optimizations. Instead of using a full run to evaluate a s...
157
click to vote
ICIP
2003
IEEE
16 years 8 months ago
2003
IEEE
In this paper we propose a system that recognises gait and quadruped structure from a sparse set of tracked points. In this work the motion information is derived from dynamic wil...
266
click to vote
SIGMOD
2008
ACM
16 years 6 months ago
2008
ACM
The problem of skyline computation has attracted considerable research attention. In the categorical domain the problem becomes more complicated, primarily due to the partially-or...
161
click to vote
CC
2007
Springer
16 years 16 days ago
2007
Springer
Abstract. To reason about programs, dynamic optimizers and analysis tools use sampling to collect a dynamic call graph (DCG). However, sampling has not achieved high accuracy with ...