696 search results - page 32 / 140 » Explaining abstract counterexamples |
126
Voted
FSTTCS
2008
Springer
15 years 3 months ago
2008
Springer
ABSTRACT. In many automated methods for proving inductive theorems, finding a suitable generalization of a conjecture is a key for the success of proof attempts. On the other hand...
113
click to vote
GD
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. Problems in simultaneous graph drawing involve the layout of several graphs on a shared vertex set. This paper describes a Graph Simultaneous Embedding Tool, GraphSET, de...
117
click to vote
TIT
2008
15 years 2 months ago
2008
Abstract--For output-symmetric discrete memoryless channels (DMCs) at even moderately high rates, fixed-block-length communication systems show no improvements in their error expon...
115
click to vote
IPL
2007
15 years 2 months ago
2007
Abstract. The intention of this note is to motivate the researchers to study Hadwiger’s conjecture for circular arc graphs. Let η(G) denote the largest clique minor of a graph G...
109
Voted
JPDC
2010
15 years 1 months ago
2010
Transactional Memory (TM) is a promising abstraction as it hides all synchronization complexities from the programmers of concurrent applications. More particularly the TM paradig...