3105 search results - page 332 / 621 » The Path-Packing Structure of Graphs |
124
click to vote
TCS
2010
15 years 3 months ago
2010
Motivated by applications that require mechanisms for describing the structure of object-oriented programs, adaptive star grammars are introduced, and their fundamental properties...
121
click to vote
WIOPT
2010
IEEE
15 years 3 months ago
2010
IEEE
—K-shell (or k-core) graph decomposition methods were introduced as a tool for studying the structure of large graphs. K-shell decomposition methods have been recently proposed [...
190
click to vote
CVPR
2011
IEEE
15 years 28 days 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 ...
152
click to vote
PPOPP
2012
ACM
14 years 11 days ago
2012
ACM
The virtues of deterministic parallelism have been argued for decades and many forms of deterministic parallelism have been described and analyzed. Here we are concerned with one ...
170
click to vote
POPL
1997
ACM
15 years 9 months ago
1997
ACM
Type systems currently available for imperative languages are too weak to detect a significant class of programming errors. For example, they cannot express the property that a l...