982 search results - page 122 / 197 » Solving Steiner tree problems in graphs to optimality |
133
Voted
IEEEMSP
2002
IEEE
15 years 5 months ago
2002
IEEE
—This paper presents an operational rate-distortion (ORD) optimal approach for skeleton-based boundary encoding. The boundary information is first decomposed into skeleton and di...
104
click to vote
CDC
2010
IEEE
14 years 7 months ago
2010
IEEE
We consider an agent-target assignment problem in an unknown environment modeled as an undirected graph. Agents do not know this graph or the locations of the targets on it. Howeve...
98
Voted
JUCS
2007
15 years 15 days ago
2007
: Sparse graphs and their associated matroids play an important role in rigidity theory, where they capture the combinatorics of some families of generic minimally rigid structures...
122
Voted
COMGEO
2006
ACM
15 years 19 days ago
2006
ACM
Predicting and optimizing the performance of ray shooting is a very important problem in computer graphics due to the severe computational demands of ray tracing and other applica...
128
Voted
ALP
1992
Springer
15 years 4 months ago
1992
Springer
Rewriting is a computational paradigm that specifies the actions, but not the control. We introduce a hierarchical structure repreat a high level of abstraction, a form of control....