Sciweavers

720 search results - page 106 / 144
» Nonrepetitive colorings of graphs
Sort
View
ISBI
2009
IEEE
14 years 2 months ago
Structural Annotation of EM Images by Graph Cut
Biological images have the potential to reveal complex signatures that may not be amenable to morphological modeling in terms of shape, location, texture, and color. An effective ...
Hang Chang, Manfred Auer, Bahram Parvin
INFOVIS
2005
IEEE
14 years 1 months ago
Visualization of Graphs with Associated Timeseries Data
The most common approach to support analysis of graphs with associated time series data include: overlay of data on graph vertices for one timepoint at a time by manipulating a vi...
Purvi Saraiya, Peter Lee, Chris North
CIVR
2005
Springer
160views Image Analysis» more  CIVR 2005»
14 years 1 months ago
Story Segmentation in News Videos Using Visual and Text Cues
Abstract. In this paper, we present a framework for segmenting the news programs into different story topics. The proposed method utilizes both visual and text information of the v...
Yun Zhai, Alper Yilmaz, Mubarak Shah
DM
2008
103views more  DM 2008»
13 years 7 months ago
Edge-colorings avoiding rainbow and monochromatic subgraphs
For two graphs G and H, let the mixed anti-Ramsey numbers, maxR(n; G, H), (minR(n; G, H)) be the maximum (minimum) number of colors used in an edge-coloring of a complete graph wi...
Maria Axenovich, Perry Iverson
PLDI
2004
ACM
14 years 1 months ago
A generalized algorithm for graph-coloring register allocation
Graph-coloring register allocation is an elegant and extremely popular optimization for modern machines. But as currently formulated, it does not handle two characteristics common...
Michael D. Smith, Norman Ramsey, Glenn H. Holloway