4894 search results - page 607 / 979 » The Guarding Problem - Complexity and Approximation |
149
click to vote
TSP
2008
15 years 4 months ago
2008
Markov random fields are designed to represent structured dependencies among large collections of random variables, and are well-suited to capture the structure of real-world sign...
129
click to vote
ALGORITHMICA
2004
15 years 4 months ago
2004
We consider the d-dimensional cube packing problem (d-CPP): given a list L of d-dimensional cubes and (an unlimited quantity of) d-dimensional unit-capacity cubes, called bins, fi...
140
click to vote
JCO
2002
15 years 4 months ago
2002
SONET(SynchronousOpticalNETworks)add-dropmultiplexers(ADMs)arethedominantcostfactor in the WDM(Wavelength Division Multiplexing)/SONET rings. The number of SONET ADMs required by a...
126
click to vote
RTS
2002
15 years 4 months ago
2002
A scheduling architecture for real-time control tasks is proposed. The scheduler uses feedback from execution-time measurements and feedforward from workload changes to adjust the...
148
click to vote
TIP
2002
15 years 4 months ago
2002
In this paper, we examine the problem of locating an object in an image when size and rotation are unknown. Previous work has shown that with known geometric parameters, an image r...