1493 search results - page 207 / 299 » Local resilience of graphs |
151
click to vote
IEEEPACT
1998
IEEE
15 years 9 months ago
1998
IEEE
Compile-time scheduling is one approach to extract parallelism which has proved effective when the execution behavior is predictable. Unfortunately, the performance of most priori...
160
Voted
PRL
2010
15 years 3 months ago
2010
: Single training image face recognition is one of main challenges to appearance-based pattern recognition techniques. Many classical dimensionality reduction methods such as LDA h...
131
click to vote
JSYML
2010
14 years 12 months ago
2010
A set A of vertices of a graph G is called d-scattered in G if no two d-neighborhoods of (distinct) vertices of A intersect. In other words, A is d-scattered if no two distinct ver...
204
click to vote
CVPR
2011
IEEE
15 years 1 months ago
2011
IEEE
In this paper, we present a novel approach to recognizing human actions from different views by view knowledge transfer. An action is originally modelled as a bag of visual-words ...
141
click to vote
KDD
2003
ACM
16 years 5 months ago
2003
ACM
Data Mining with Bayesian Network learning has two important characteristics: under broad conditions learned edges between variables correspond to causal influences, and second, f...