10988 search results - page 109 / 2198 » Algorithmic Folding Complexity |
109
Voted
FGR
2008
IEEE
15 years 9 months ago
2008
IEEE
This paper presents a novel algorithm for estimating complex human motion from 3D video. We base our algorithm on a model-based approach which uses a complete surface mesh of a 3D...
131
click to vote
PODC
2006
ACM
15 years 8 months ago
2006
ACM
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
136
click to vote
ICIP
2008
IEEE
15 years 9 months ago
2008
IEEE
Recently Zhang et al described an algorithm for the detection of ±1 LSB steganography based on the statistics of the amplitudes of local extrema in the greylevel histogram. Exper...
124
click to vote
WEBI
2005
Springer
15 years 8 months ago
2005
Springer
Several algorithms based on link analysis have been developed to measure the importance of nodes on a graph such as pages on the World Wide Web. PageRank and HITS are the most pop...
123
click to vote
CONCUR
2006
Springer
15 years 4 months ago
2006
Springer
In regular inference, the problem is to infer a regular language, typically represented by a deterministic finite automaton (DFA) from answers to a finite set of membership querie...