Sciweavers

5052 search results - page 18 / 1011
» On the Complexity of Ordered Colorings
Sort
View
SIGMETRICS
2010
ACM
197views Hardware» more  SIGMETRICS 2010»
14 years 1 months ago
Coloring spatial point processes with applications to peer discovery in large wireless networks
In this paper, we study distributed channel assignment in wireless networks with applications to peer discovery in ad hoc wireless networks. We model channel assignment as a color...
Jian Ni, R. Srikant, Xinzhou Wu
IAJIT
2010
119views more  IAJIT 2010»
13 years 7 months ago
Improving the Effectiveness of the Color Coherence Vector
: This paper was motivated by the desire to improve the effectiveness of retrieving images on the basis of their color content by improving the Color Coherence Vector method. There...
Alaa Al-Hamami, Hisham Al-Rashdan
CORR
2007
Springer
116views Education» more  CORR 2007»
13 years 8 months ago
Complexity of some Path Problems in DAGs and Linear Orders
We investigate here the computational complexity of three natural problems in directed acyclic graphs. We prove their NP Completeness and consider their restrictions to linear orde...
Serge Burckel
WG
1992
Springer
14 years 15 days ago
On the Complexity of Partial Order Properties
The recognition complexityof ordered set properties is considered, i.e.how many questions have to be asked to decide if an unknown ordered set has a prescribed property. We prove ...
Stefan Felsner, Dorothea Wagner
ORDER
2010
110views more  ORDER 2010»
13 years 6 months ago
The Complexity of Embedding Orders into Small Products of Chains
Embedding a partially ordered set into a product of chains is a classical way to encode it. Such encodings have been used in various fields such as object oriented programming or ...
Olivier Raynaud, Eric Thierry