Sciweavers

1208 search results - page 113 / 242
» On Counting Generalized Colorings
Sort
View
IPL
2006
69views more  IPL 2006»
13 years 9 months ago
On computing the smallest four-coloring of planar graphs and non-self-reducible sets in P
We show that computing the lexicographically first four-coloring for planar graphs is p 2hard. This result optimally improves upon a result of Khuller and Vazirani who prove this ...
André Große, Jörg Rothe, Gerd We...
JCT
2006
168views more  JCT 2006»
13 years 9 months ago
Mono-multi bipartite Ramsey numbers, designs, and matrices
Eroh and Oellermann defined BRR(G1, G2) as the smallest N such that any edge coloring of the complete bipartite graph KN,N contains either a monochromatic G1 or a multicolored G2....
Paul N. Balister, András Gyárf&aacut...
VDA
2010
186views Visualization» more  VDA 2010»
13 years 11 months ago
Tile-based parallel coordinates and its application in financial visualization
Parallel coordinates technique has been widely used in information visualization applications and it has achieved great success in visualizing multivariate data and perceiving the...
Jamal Alsakran, Ye Zhao, Xinlei Zhao
CORR
2004
Springer
144views Education» more  CORR 2004»
13 years 9 months ago
The Google Similarity Distance
Words and phrases acquire meaning from the way they are used in society, from their relative semantics to other words and phrases. For computers the equivalent of `society' is...
Rudi Cilibrasi, Paul M. B. Vitányi
WWW
2009
ACM
14 years 10 months ago
Competitive analysis from click-through log
Existing keyword suggestion tools from various search engine companies could automatically suggest keywords related to the advertisers' products or services, counting in simp...
Gang Wang, Jian Hu, Yunzhang Zhu, Hua Li, Zheng Ch...