Sciweavers

442 search results - page 11 / 89
» Representing Colors as Three Numbers
Sort
View
DM
2007
83views more  DM 2007»
13 years 8 months ago
Restricted colored permutations and Chebyshev polynomials
Several authors have examined connections between restricted permutations and Chebyshev polynomials of the second kind. In this paper we prove analogues of these results for color...
Eric S. Egge
ICMCS
2007
IEEE
173views Multimedia» more  ICMCS 2007»
14 years 2 months ago
Tracking Multiple Objects using Probability Hypothesis Density Filter and Color Measurements
Most methods for multiple object tracking in video represent the state of multi-objects in a high dimensional joint state space. This leads to high computational complexity. This ...
Nam Trung Pham, Weimin Huang, Sim Heng Ong
PODC
2009
ACM
14 years 9 months ago
Coloring unstructured wireless multi-hop networks
We present a randomized coloring algorithm for the unstructured radio network model, a model comprising autonomous nodes, asynchronous wake-up, no collision detection and an unkno...
Johannes Schneider, Roger Wattenhofer
ESA
2006
Springer
137views Algorithms» more  ESA 2006»
14 years 3 days ago
Deciding Relaxed Two-Colorability - A Hardness Jump
A coloring is proper if each color class induces connected components of order one (where the order of a graph is its number of vertices). Here we study relaxations of proper two-c...
Robert Berke, Tibor Szabó
ENDM
2007
149views more  ENDM 2007»
13 years 8 months ago
Oriented vertex and arc colorings of partial 2-trees
d Abstract) Pascal Ochem∗, Alexandre Pinlou† LaBRI, Université Bordeaux 1, 351, Cours de la Libération, 33405 Talence Cedex, France March 16, 2007 A homomorphism from an ori...
Pascal Ochem, Alexandre Pinlou