1363 search results - page 120 / 273 » The road coloring problem |
120
click to vote
COCOON
1998
Springer
15 years 4 months ago
1998
Springer
Abstract. In this paper we present the new data structure Colored Sector Search Tree (CSST ) for solving the Nearest-Foreign-Neighbor Query Problem (NFNQP ): Given a set S of n col...
CGF
2006
14 years 12 months ago
2006
Linear interpolation is the standard image blending method used in image compositing. By averaging in the dynamic range, it reduces contrast and visibly degrades the quality of co...
120
click to vote
CC
1998
Springer
14 years 11 months ago
1998
Springer
Graph coloring is the dominant paradigm for global register allocation [8, 7, 4]. Coloring allocators use an interference graph, Z, to model conflicts that prevent two values from ...
124
click to vote
EUROGRAPHICS
2010
Eurographics
15 years 9 months ago
2010
Eurographics
In this paper we show how to use two-colored pixels as a generic tool for image processing. We apply twocolored pixels as a basic operator as well as a supporting data structure f...
109
click to vote
ECMDAFA
2010
Springer
15 years 3 months ago
2010
Springer
Dynamic UML models like sequence diagrams (SD) lack sufficient formal semantics, making it difficult to build automated tools for their analysis, simulation and validation. A commo...