773 search results - page 27 / 155 » Traversing the Machining Graph |
117
click to vote
GD
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. In this paper we present an algorithm for drawing an undirected graph G which takes advantage of the structure of the modular decomposition tree of G. Specifically, our ...
106
click to vote
SADM
2008
15 years 1 months ago
2008
: In this paper, we introduce the concept of -orthogonal patterns to mine a representative set of graph patterns. Intuitively, two graph patterns are -orthogonal if their similarit...
141
click to vote
POPL
1993
ACM
15 years 5 months ago
1993
ACM
e data structures are abstractions of simple records and pointers. They impose a shape invariant, which is verified at compiletime and exploited to automatically generate code fo...
107
Voted
ICASSP
2009
IEEE
15 years 5 months ago
2009
IEEE
We regarded information retrieval as a graph search problem and proposed several novel dialog strategies that can recover from misrecognition through a spoken dialog that traverse...
121
Voted
GD
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. As graphics processors become powerful, ubiquitous and easier to program, they have also become more amenable to general purpose high-performance computing, including the...