15 search results - page 2 / 3 » The complexity of chromatic strength and chromatic edge stre... |
86
Voted
SIAMCOMP
1998
14 years 9 months ago
1998
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on p...
ECCV
1996
Springer
15 years 11 months ago
1996
Springer
We present a technique to extract complex suburban roofs from sets of aerial images. Because we combine 2-D edge information, photometric and chromatic attributes and 3-D informati...
ICIP
2002
IEEE
15 years 11 months ago
2002
IEEE
Text detection is fundamental to video information retrieval and indexing. Existing methods cannot handle well those texts with different contrast or embedded in a complex backgro...
PODC
2006
ACM
15 years 3 months ago
2006
ACM
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
BMCBI
2005
14 years 9 months ago
2005
Background: Protein-protein association is essential for a variety of cellular processes and hence a large number of investigations are being carried out to understand the princip...