132 search results - page 7 / 27 » Simplices and Spectra of Graphs |
MFCS
1997
Springer
15 years 1 months ago
1997
Springer
We prove an exponential lower bound for the length of any resolution proof for the same set of clauses as the one used by Urquhart [13]. Our contribution is a signiļ¬cant simpliļ¬...
104
Voted
WWW
2002
ACM
14 years 9 months ago
2002
ACM
In this paper we present a graphical query language for XML. The language, based on a simple form of graph grammars, permits us to extract data and reorganize information in a new...
INFOCOM
2006
IEEE
15 years 3 months ago
2006
IEEE
ā Unstructured p2p and overlay network applications often require that a random graph be constructed, and that some form of random node selection take place over that graph. A ke...
100
click to vote
COMPSAC
2011
IEEE
13 years 9 months ago
2011
IEEE
AbstractāStatistical fault localization techniques find suspicious faulty program entities in programs by comparing passed and failed executions. Existing studies show that such ...
DIS
2006
Springer
15 years 1 months ago
2006
Springer
Parametric Embedding (PE) has recently been proposed as a general-purpose algorithm for class visualisation. It takes class posteriors produced by a mixture-based clustering algori...