17366 search results - page 215 / 3474 » New Revision Algorithms |
158
click to vote
ICDE
2011
IEEE
14 years 8 months ago
2011
IEEE
—It is increasingly common to find graphs in which edges bear different types, indicating a variety of relationships. For such graphs we propose a class of reachability queries ...
152
click to vote
CORR
2012
Springer
14 years 10 days ago
2012
Springer
Graph pattern matching is often defined in terms of subgraph isomorphism, an np-complete problem. To lower its complexity, various extensions of graph simulation have been consid...
135
Voted
MICCAI
2007
Springer
16 years 5 months ago
2007
Springer
This paper introduces a new benchmark study of evaluating landmark-based shape correspondence used for statistical shape analysis. Different from previous shape-correspondence eval...
145
click to vote
DATE
2005
IEEE
15 years 10 months ago
2005
IEEE
In this paper we introduce a new task model that is specifically targeted towards representing stream processing applications. Examples of such applications are those involved in...
146
click to vote
ADAEUROPE
2005
Springer
15 years 10 months ago
2005
Springer
: In previous papers we had presented an application program interface (API) that enabled applications to use application-defined scheduling algorithms for Ada tasks in a way compa...