503 search results - page 56 / 101 » An Independence Relation for Sets of Secrets |
ANOR
2005
14 years 9 months ago
2005
In Hell et al. (2004), we have previously observed that, in a chordal graph G, the maximum number of independent r-cliques (i.e., of vertex disjoint subgraphs of G, each isomorphic...
NDJFL
2000
14 years 9 months ago
2000
In this paper, we explore Fregean metatheory, what Frege called the New Science. The New Science arises in the context of Frege's debate with Hilbert over independence proofs ...
SIAMSC
2010
14 years 4 months ago
2010
Abstract. BDDC algorithms are constructed and analyzed for the system of almost incompressible elasticity discretized with Gauss-Lobatto-Legendre spectral elements in three dimensi...
172
click to vote
SPAA
2012
ACM
13 years 7 days ago
2012
ACM
In this paper we study distributed algorithms on massive graphs where links represent a particular relationship between nodes (for instance, nodes may represent phone numbers and ...
102
click to vote
ICPR
2006
IEEE
15 years 11 months ago
2006
IEEE
In this paper, a novel unsupervised approach for the segmentation of unorganized 3D points sets is proposed. The method derives by the mean shift clustering paradigm devoted to se...