Sciweavers

221 search results - page 16 / 45
» Twinkle: programming with color
Sort
View
IJAIT
2006
103views more  IJAIT 2006»
14 years 10 months ago
Rendering Aesthetic Impressions of Text in Color Space
and renders an abstract color grid artwork reminiscent of early twentieth century abstract expressionism. Following Dewey's psychological interpretation of "aesthetic&quo...
Hugo Liu, Pattie Maes
LCPC
2005
Springer
15 years 3 months ago
Revisiting Graph Coloring Register Allocation: A Study of the Chaitin-Briggs and Callahan-Koblenz Algorithms
Techniques for global register allocation via graph coloring have been extensively studied and widely implemented in compiler frameworks. This paper examines a particular variant â...
Keith D. Cooper, Anshuman Dasgupta, Jason Eckhardt
CN
2007
154views more  CN 2007»
14 years 10 months ago
Disjoint multipath routing using colored trees
— Multipath routing (MPR) is an effective strategy to achieve robustness, load balancing, congestion reduction, and increased throughput in computer networks. Disjoint multipath ...
Srinivasan Ramasubramanian, Harish Krishnamoorthy,...
106
Voted
MFCS
2009
Springer
15 years 2 months ago
An Improved Approximation Bound for Spanning Star Forest and Color Saving
We present a simple algorithm for the maximum spanning star forest problem. We take advantage of the fact that the problem is a special case of complementary set cover and we adapt...
Stavros Athanassopoulos, Ioannis Caragiannis, Chri...
EOR
2008
75views more  EOR 2008»
14 years 10 months ago
Soft car sequencing with colors: Lower bounds and optimality proofs
This paper is a study of the car sequencing problem, when feature spacing constraints are soft and colors of vehicles are taken into account. Both pseudo-polynomial algorithms and ...
Thierry Benoist