2314 search results - page 159 / 463 » Minimal Partitions of a Graph |
132
click to vote
CORR
2007
Springer
15 years 3 months ago
2007
Springer
A tree decomposition of the coordinates of a code is a mapping from the coordinate set to the set of vertices of a tree. A tree decomposition can be extended to a tree realization,...
154
click to vote
Publication
Surface reconstruction from gradient fields is an important
final step in several applications involving gradient manipulations
and estimation. Typically, the resulting gradient
...
137
click to vote
SPAA
2005
ACM
15 years 9 months ago
2005
ACM
We study the admission control problem in general networks. Communication requests arrive over time, and the online algorithm accepts or rejects each request while maintaining the...
160
click to vote
FOCS
2008
IEEE
15 years 5 months ago
2008
IEEE
In the mobile facility location problem, which is a variant of the classical Uncapacitated Facility Location and kMedian problems, each facility and client is assigned to a start ...
152
click to vote
SPAA
2010
ACM
15 years 4 months ago
2010
ACM
We develop logarithmic approximation algorithms for extremely general formulations of multiprocessor multiinterval offline task scheduling to minimize power usage. Here each proce...