Sciweavers

1074 search results - page 37 / 215
» Adaptive color reduction
Sort
View
EJC
2008
14 years 11 months ago
On digraph coloring problems and treewidth duality
It is known that every constraint-satisfaction problem (CSP) reduces, and is in fact polynomially equivalent, to a digraph coloring problem. By carefully analyzing the constructio...
Albert Atserias
CN
2007
154views more  CN 2007»
14 years 11 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,...
ECCV
2002
Springer
16 years 28 days ago
Assorted Pixels: Multi-sampled Imaging with Structural Models
Abstract. Multi-sampled imaging is a general framework for using pixels on an image detector to simultaneously sample multiple dimensions of imaging (space, time, spectrum, brightn...
Shree K. Nayar, Srinivasa G. Narasimhan
83
Voted
ICIP
2006
IEEE
16 years 21 days ago
A Model for the Electronic Representation of Bank Checks
The substitution of physical bank check exchange by electronic check image transfer brings agility, security and cost reduction to the clearing system. In this paper, we propose a...
Danilo Dias, Ricardo L. de Queiroz
IV
1999
IEEE
209views Visualization» more  IV 1999»
15 years 3 months ago
Continuous Field Visualization with Multi-Resolution Textures
A method of using a texture mapping approach to color scales is described, for the purpose of visualizing continuous field scalar quantities. The technique is most appropriate whe...
Ian Curington