2107 search results - page 149 / 422 » Computing Small Search Numbers in Linear Time |
120
click to vote
IWOCA
2009
Springer
15 years 10 months ago
2009
Springer
A vertex subset D of a graph G is a dominating set if every vertex of G is either in D or is adjacent to a vertex in D. The paired-domination problem on G asks for a minimum-cardi...
133
Voted
DAC
1994
ACM
15 years 7 months ago
1994
ACM
A powerful combinational path sensitization engine is required for the efficient implementation of tools for test pattern generation, timing analysis, and delay fault testing. Path...
132
click to vote
ICCV
2009
IEEE
16 years 8 months ago
2009
IEEE
Fast retrieval methods are critical for large-scale and
data-driven vision applications. Recent work has explored
ways to embed high-dimensional features or complex distance
fun...
121
Voted
MFCS
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We introduce nondeterministic graph searching with a controlled amount of nondeterminism and show how this new tool can be used in algorithm design and combinatorial anal...
112
Voted
CVPR
2006
IEEE
16 years 5 months ago
2006
IEEE
We propose human action detection based on a successive convex matching scheme. Human actions are represented as sequences of postures and specific actions are detected in video b...