1002 search results - page 184 / 201 » Towards Graph Programs for Graph Algorithms |
114
click to vote
TELETRAFFIC
2007
Springer
15 years 8 months ago
2007
Springer
Multi-service mesh networks allow existence of guaranteed delay Quality-of-Service (QoS) traffic streams such as Voice over IP and best effort QoS traffic streams such as file tr...
116
click to vote
MICAI
2005
Springer
15 years 7 months ago
2005
Springer
Although undirected cycles in directed graphs of Bayesian belief networks have been thoroughly studied, little attention has so far been given to a systematic analysis of directed ...
150
Voted
FSTTCS
2003
Springer
15 years 7 months ago
2003
Springer
The Covering Steiner problem is a common generalization of the k-MST and Group Steiner problems. An instance of the Covering Steiner problem consists of an undirected graph with ed...
115
Voted
ICRA
2002
IEEE
15 years 6 months ago
2002
IEEE
Trajectory design for high-dimensional systems with nonconvex constraints is a challenging problem considered in this paper. Classical dynamic programming is often employed, but c...
110
click to vote
SIGMOD
1998
ACM
15 years 6 months ago
1998
ACM
Semistructured data is characterized by the lack of any fixed and rigid schema, although typically the data hassomeimplicitstructure. While thelack offixedschemamakesextracting ...