688 search results - page 78 / 138 » Comparison of Conceptual Graphs |
PPOPP
2012
ACM
13 years 5 months ago
2012
ACM
Speedups demonstrated for finding the biconnected components of a graph: 9x to 33x on the Explicit Multi-Threading (XMT) many-core computing platform relative to the best serial ...
107
click to vote
IPPS
1999
IEEE
15 years 2 months ago
1999
IEEE
In order to extract high levels of performance from modern parallel architectures, the effective management of deep memory hierarchies is very important. While architectural advan...
ICDCS
2010
IEEE
14 years 11 months ago
2010
IEEE
Abstract—Coverage problem is a fundamental issue in wireless ad hoc and sensor networks. Previous techniques for coverage scheduling often require accurate location information o...
105
click to vote
ICCS
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Previous work of the authors has studied a notion of implication between sets of sequences based on the conceptual structure of a Galois lattice, and also a way of repres...
104
click to vote
ER
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Understanding a large schema without the assistance of persons already familiar with it (and its associated applications), is a hard and very time consuming task that occ...