Sciweavers

4171 search results - page 501 / 835
» Choice numbers of graphs
Sort
View
DAM
2002
82views more  DAM 2002»
15 years 6 months ago
On the computational complexity of strong edge coloring
In the strong edge coloring problem, the objective is to color the edges of the given graph with the minimum number of colors so that every color class is an induced matching. In ...
Mohammad Mahdian
JAIR
2010
145views more  JAIR 2010»
15 years 5 months ago
Fast Set Bounds Propagation Using a BDD-SAT Hybrid
Binary Decision Diagram (BDD) based set bounds propagation is a powerful approach to solving set-constraint satisfaction problems. However, prior BDD based techniques incur the si...
Graeme Gange, Peter J. Stuckey, Vitaly Lagoon
TIT
2010
141views Education» more  TIT 2010»
15 years 1 months ago
Distributed averaging via lifted Markov chains
Abstract--Motivated by applications of distributed linear estimation, distributed control, and distributed optimization, we consider the question of designing linear iterative algo...
Kyomin Jung, Devavrat Shah, Jinwoo Shin
ICDE
2009
IEEE
177views Database» more  ICDE 2009»
16 years 8 months ago
Light-Weight, Runtime Verification of Query Sources
Modern database systems increasingly make use of networked storage. This storage can be in the form of SAN's or in the form of shared-nothing nodes in a cluster. One type of a...
Tingjian Ge, Stanley B. Zdonik
CHI
2001
ACM
16 years 7 months ago
Chinese input with keyboard and eye-tracking: an anatomical study
Chinese input presents unique challenges to the field of human computer interaction. This study provides an anatomical analysis of today's standard Chinese input process, whi...
Jingtao Wang, Shumin Zhai, Hui Su