4009 search results - page 409 / 802 » Clustering on Complex Graphs |
166
click to vote
CONCUR
2004
Springer
16 years 7 days ago
2004
Springer
In this paper, we study the complexity of model-checking formulas of three important real-time logics (MTL, MITL, and TCTL) over restricted sets of timed paths. The classes of rest...
184
click to vote
COMPGEOM
2003
ACM
16 years 3 days ago
2003
ACM
Given a polygonal curve and a geometric graph, we describe an efficient algorithm to find a path in the graph which is most similar to the curve, using the well-known Fr´echet d...
209
click to vote
CC
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. We present a method of specifying standard imperative program optimisations as a rewrite system. To achieve this we have extended the idea of matching sub-terms in expres...
170
click to vote
CSCLP
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Traditional resources in scheduling are simple machines where a capacity is the main restriction. However, in practice there frequently appear resources with more complex...
179
click to vote
ICCD
1995
IEEE
15 years 10 months ago
1995
IEEE
Optimization of hardware resources for conditional data-flow graph behavior is particularly important when conditional behavior occurs in cyclic loops and maximization of through...