1749 search results - page 161 / 350 » Conditional colorings of graphs |
186
click to vote
CIVR
2005
Springer
16 years 5 days ago
2005
Springer
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...
188
click to vote
SIGMOD
2005
ACM
16 years 5 days ago
2005
ACM
Recursion represents an important addition to the SQL language. This work focuses on the optimization of linear requeries in SQL. To provide an abstract framework for discussion, ...
174
click to vote
FLAIRS
2006
15 years 8 months ago
2006
A conditioning graph is a form of recursive factorization which minimizes the memory requirements and simplifies the implementation of inference in Bayesian networks. The time com...
155
click to vote
DM
2008
15 years 6 months ago
2008
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...
175
click to vote
PLDI
2004
ACM
16 years 1 days ago
2004
ACM
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...