5100 search results - page 425 / 1020 » The Linear Complexity of a Graph |
213
click to vote
COMPGEOM
2003
ACM
16 years 28 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...
235
Voted
CC
2001
Springer
16 years 5 days 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...
190
Voted
CSCLP
2006
Springer
15 years 11 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...
194
Voted
ICCD
1995
IEEE
15 years 11 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...
201
Voted
NIPS
2003
15 years 9 months ago
2003
We consider the question of how well a given distribution can be approximated with probabilistic graphical models. We introduce a new parameter, effective treewidth, that captures...