3267 search results - page 292 / 654 » Generalized quasirandom graphs |
181
click to vote
ECML
2006
Springer
15 years 8 months ago
2006
Springer
We propose preprocessing spectral clustering with b-matching to remove spurious edges in the adjacency graph prior to clustering. B-matching is a generalization of traditional maxi...
167
click to vote
CCCG
2008
15 years 8 months ago
2008
This paper builds a general mathematical and algorithmic theory for balloon-twisting structures, from balloon animals to balloon polyhedra, by modeling their underlying graphs (ed...
162
click to vote
UAI
2008
15 years 8 months ago
2008
We conjecture that the worst case number of experiments necessary and sufficient to discover a causal graph uniquely given its observational Markov equivalence class can be specif...
172
click to vote
DMCS
2003
15 years 8 months ago
2003
d Abstract) Anah´ı Gajardo† GI2MA, Departamento de Ingenier´ıa Matem´atica, Universidad de Concepci´on, Casilla 160-C, correo 3, Concepci´on, Chile The Langton’s ant is ...
162
click to vote
IJCAI
2001
15 years 8 months ago
2001
The progressive processing model allows a system to trade off resource consumption against the quality of the outcome by mapping each activity to a graph of potential solution met...