Sciweavers

930 search results - page 16 / 186
» Color Differential Structure
Sort
View
ESA
2004
Springer
137views Algorithms» more  ESA 2004»
14 years 23 days ago
Fast 3-Coloring Triangle-Free Planar Graphs
We show the first o(n2 ) algorithm for coloring vertices of trianglefree planar graphs using three colors. The time complexity of the algorithm is O(n log n). Our approach can be ...
Lukasz Kowalik
CHI
2003
ACM
14 years 7 months ago
Visualizing the affective structure of a text document
This paper introduces an approach for graphically visualizing the affective structure of a text document. A document is first affectively analyzed using a unique textual affect se...
Hugo Liu, Ted Selker, Henry Lieberman
CG
2010
Springer
13 years 7 months ago
ftc - Floating precision texture compression
This paper presents new fixed-rate texture compression systems for RGB and RGBA images, which use variable precision differential encoding for the color codewords, resulting in re...
Philipp Klaus Krause
TIP
2008
208views more  TIP 2008»
13 years 7 months ago
Vision Processing for Realtime 3-D Data Acquisition Based on Coded Structured Light
Structured light vision systems have been successfully used for accurate measurement of 3-D surfaces in computer vision. However, their applications are mainly limited to scanning ...
S. Y. Chen, Y. F. Li, Jianwei Zhang
COMPGEOM
2009
ACM
14 years 1 months ago
Computing hereditary convex structures
Color red and blue the n vertices of a convex polytope P in R3 . Can we compute the convex hull of each color class in o(n log n)? What if we have χ > 2 colors? What if the co...
Bernard Chazelle, Wolfgang Mulzer