Sciweavers

2063 search results - page 267 / 413
» connection 2007
Sort
View
89
Voted
ENDM
2007
88views more  ENDM 2007»
15 years 1 months ago
Graph coloring with no large monochromatic components
For a graph G and an integer t we let mcct(G) be the smallest m such that there exists a coloring of the vertices of G by t colors with no monochromatic connected subgraph having ...
Nathan Linial, Jirí Matousek, Or Sheffet, G...
CVPR
2007
IEEE
16 years 3 months ago
Two thresholds are better than one
The concept of the Bayesian optimal single threshold is a well established and widely used classification technique. In this paper, we prove that when spatial cohesion is assumed ...
Tao Zhang, Terrance E. Boult, R. C. Johnson
97
Voted
WDAG
2007
Springer
73views Algorithms» more  WDAG 2007»
15 years 7 months ago
On Self-stabilizing Synchronous Actions Despite Byzantine Attacks
Consider a distributed network of n nodes that is connected to a global source of “beats”. All nodes receive the “beats” simultaneously, and operate in lock-step. A scheme ...
Danny Dolev, Ezra N. Hoch
153
Voted
IPPS
2007
IEEE
15 years 7 months ago
Software and Algorithms for Graph Queries on Multithreaded Architectures
Search-based graph queries, such as finding short paths and isomorphic subgraphs, are dominated by memory latency. If input graphs can be partitioned appropriately, large cluster...
Jonathan W. Berry, Bruce Hendrickson, Simon Kahan,...
COCOON
2007
Springer
15 years 7 months ago
The Informational Content of Canonical Disjoint NP-Pairs
We investigate the connection between propositional proof systems and their canonical pairs. It is known that simulations between proof systems translate to reductions between the...
Christian Glaßer, Alan L. Selman, Liyu Zhang