4865 search results - page 593 / 973 » The Complexity of Graph Connectivity |
162
click to vote
ISBI
2004
IEEE
16 years 7 months ago
2004
IEEE
We use multi-figure m-reps to represent anatomical objects, such as human livers, with named components. Each component is represented as a single figure m-rep. These figures of t...
191
click to vote
VLSID
2002
IEEE
16 years 7 months ago
2002
IEEE
Directed test program-based verification or formal verification methods are usually quite ineffective on large cachecoherent, non-uniform memory access (CC-NUMA) multiprocessors b...
151
click to vote
DCC
2001
IEEE
16 years 6 months ago
2001
IEEE
The automorphism group of the Barnes-Wall lattice Lm in dimension 2m (m = 3) is a subgroup of index 2 in a certain "Clifford group" Cm of structure 21+2m + .O+ (2m, 2). ...
172
click to vote
ECAL
2007
Springer
16 years 1 months ago
2007
Springer
In this paper1 , we introduce a method, Assortative Preferential Attachment, to grow a scale-free network with a given assortativeness value. Utilizing this method, we investigate ...
193
click to vote
ESWS
2007
Springer
16 years 1 months ago
2007
Springer
State-of-the-art research on automated learning of ontologies from text currently focuses on inexpressive ontologies. The acquisition of complex axioms involving logical connective...