27 search results - page 4 / 6 » On a graph coloring problem arising from discrete tomography |
CVPR
2004
IEEE
13 years 9 months ago
2004
IEEE
Graphical models are powerful tools for processing images. However, the large dimensionality of even local image data poses a difficulty: representing the range of possible graphi...
FCT
2003
Springer
13 years 11 months ago
2003
Springer
The bandwidth minimization problem has a long history and a number of practical applications. In this paper we introduce a natural extension of bandwidth to partially ordered layo...
COMPGEOM
2004
ACM
13 years 11 months ago
2004
ACM
A frequently arising problem in computational geometry is when a physical structure, such as an ad-hoc wireless sensor network or a protein backbone, can measure local information...
FOCS
2007
IEEE
14 years 3 days ago
2007
IEEE
We present a near-optimal reduction from approximately counting the cardinality of a discrete set to approximately sampling elements of the set. An important application of our wo...
SODA
2010
ACM
14 years 3 months ago
2010
ACM
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...