3958 search results - page 443 / 792 » Dynamic Graph Algorithms with Applications |
172
click to vote
WWW
2003
ACM
16 years 7 months ago
2003
ACM
We propose two new tools to address the evolution of hyperlinked corpora. First, we define time graphs to extend the traditional notion of an evolving directed graph, capturing li...
186
click to vote
AAAI
2007
15 years 9 months ago
2007
In this paper, we consider the problem of composing a set of web services, where the requirements are specified in terms of the input and output messages of the composite workfl...
191
click to vote
ICCAD
1994
IEEE
15 years 10 months ago
1994
IEEE
A simple extension of the critical path method is presented which allows more accurate optimization of circuits with level-sensitive latches. The extended formulation provides a s...
174
click to vote
WADS
1995
Springer
15 years 10 months ago
1995
Springer
We consider the problem of obtaining “nice” quadrangulations of planar sets of points. For many applications “nice” means that the quadrilaterals obtained are convex if po...
170
click to vote
GLOBECOM
2008
IEEE
16 years 1 months ago
2008
IEEE
— This paper investigates the problem of the formation of an uplink tree structure among the IEEE 802.16j network’s relay stations (RSs) and their serving base station (MR-BS)....