8540 search results - page 394 / 1708 » The Dynamic Servers Problem |
148
click to vote
ICPR
2008
IEEE
15 years 11 months ago
2008
IEEE
Dynamic texture (DT) is an extension of texture to the temporal domain. In this paper, we address the problem of segmenting DT into disjoint regions in an unsupervised way. Each r...
110
click to vote
COCO
2005
Springer
15 years 10 months ago
2005
Springer
We propose a model called priority branching trees (pBT ) for backtracking and dynamic programming algorithms. Our model generalizes both the priority model of Borodin, Nielson an...
135
Voted
WG
2005
Springer
15 years 10 months ago
2005
Springer
This paper considers the problem of maintaining a compact representation (O(n) space) of permutation graphs under vertex and edge modifications (insertion or deletion). That repr...
146
Voted
FOCS
1992
IEEE
15 years 8 months ago
1992
IEEE
We describe dynamic data structures for half-space range reporting and for maintaining the minima of a decomposable function. Using these data structures, we obtain efficient dyna...
125
Voted
CBSE
2006
Springer
15 years 8 months ago
2006
Springer
This paper addresses the unavoidable problem of dynamic reconfiguration in component-based system with a hierarchical component model. The presented solution is based on (1) allowi...