197 search results - page 7 / 40 » Some Topological Methods in Graph Coloring Theory |
122
Voted
TACAS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Given a theory T and two formulas A and B jointly unsatisfiable in T , a theory interpolant of A and B is a formula I such that (i) its non-theory symbols are shared by ...
115
Voted
INFOCOM
2003
IEEE
15 years 8 months ago
2003
IEEE
— Considerable attention has been focused on the properties of graphs derived from Internet measurements. Router-level topologies collected via traceroute-like methods have led s...
153
click to vote
ICIP
2008
IEEE
15 years 10 months ago
2008
IEEE
Text segmentation, or named text binarization, is usually an essential step for text information extraction from images and videos. However, most existing text segmentation method...
129
click to vote
ESOP
2010
Springer
16 years 25 days ago
2010
Springer
Iterated Register Coalescing (IRC) is a widely used heuristic for performing register allocation via graph coloring. Many implementations in existing compilers follow (more or less...
119
Voted
IC
2003
15 years 4 months ago
2003
Abstract— In this paper, we develop methods to “sample” a large real network into a small realistic graph. Although topology modeling has received a lot attention lately, it ...