3204 search results - page 366 / 641 » The Alcuin Number of a Graph |
186
click to vote
AAAI
2011
14 years 6 months ago
2011
In this paper, we model the pair-wise similarities of a set of documents as a weighted network with a single cutoff parameter. Such a network can be thought of an ensemble of unwe...
244
Voted
ESA
2011
Springer
14 years 6 months ago
2011
Springer
Back in 1995, Alt and Godau gave an efficient algorithm for deciding whether a given curve resembles some part of a larger curve under a fixed Fr´echet distance, achieving a runn...
230
click to vote
ISCA
2012
IEEE
13 years 9 months ago
2012
IEEE
—As the scales of parallel applications and platforms increase the negative impact of communication latencies on performance becomes large. Fortunately, modern High Performance C...
174
click to vote
EJC
2008
15 years 6 months ago
2008
Gerards and Seymour (see [T.R. Jensen, B. Toft, Graph Coloring Problems, Wiley-Interscience, 1995], page 115) conjectured that if a graph has no odd complete minor of order p, the...
190
click to vote
INFOCOM
1997
IEEE
15 years 11 months ago
1997
IEEE
A secret sharing schemefor the prohibited structure is a method of sharing a master key among a finite set of participants in such a way that only certain pre-specified subsetsof ...