254 search results - page 37 / 51 » Deterministic Soliton Graphs |
TAPSOFT
1997
Springer
15 years 1 months ago
1997
Springer
This paper considers the complexity of interprocedural function pointer may-alias analysis, i.e., determining the set of functions that a function pointer (in a language such as C...
ICALP
2000
Springer
15 years 1 months ago
2000
Springer
We establish that the algorithmic complexity of the minimum spanning tree problem is equal to its decision-tree complexity. Specifically, we present a deterministic algorithm to fi...
IPCO
2007
14 years 11 months ago
2007
Consider the following Steiner Tree leasing problem. Given a graph G = (V, E) with root r, and a sequence of terminal sets Dt ⊆ V for each day t ∈ [T]. A feasible solution to t...
AUTOMATICA
2006
14 years 9 months ago
2006
In this paper a novel, Gibbs sampler-based algorithm is proposed for coordination of autonomous swarms. The swarm is modeled as a Markov random field (MRF) on a graph with a time-...
112
click to vote
CVPR
2011
IEEE
14 years 4 months ago
2011
IEEE
Representing articulated objects as a graphical model has gained much popularity in recent years, often the root node of the graph describes the global position and orientation of...