Sciweavers

9532 search results - page 87 / 1907
» Logic, Graphs, and Algorithms
Sort
View
WWW
2006
ACM
15 years 12 months ago
Web ontology segmentation: analysis, classification and use
Ontologies are at the heart of the semantic web. They define the concepts and relationships that make global interoperability possible. However, as these ontologies grow in size t...
Julian Seidenberg, Alan L. Rector
ICDM
2003
IEEE
136views Data Mining» more  ICDM 2003»
15 years 4 months ago
Statistical Relational Learning for Document Mining
A major obstacle to fully integrated deployment of many data mining algorithms is the assumption that data sits in a single table, even though most real-world databases have compl...
Alexandrin Popescul, Lyle H. Ungar, Steve Lawrence...
WAW
2007
Springer
122views Algorithms» more  WAW 2007»
15 years 5 months ago
A Geometric Preferential Attachment Model of Networks II
We study a random graph Gn that combines certain aspects of geometric random graphs and preferential attachment graphs. This model yields a graph with power-law degree distributio...
Abraham D. Flaxman, Alan M. Frieze, Juan Vera
IWOCA
2009
Springer
160views Algorithms» more  IWOCA 2009»
15 years 3 months ago
Note on Decomposition of Kn, n into (0, j)-prisms
R. H¨aggkvist proved that every 3-regular bipartite graph of order 2n with no component isomorphic to the Heawood graph decomposes the complete bipartite graph K6n,6n. In [2] the ...
Sylwia Cichacz, Dalibor Froncek, Petr Kovár
SPDP
1991
IEEE
15 years 2 months ago
Fault-tolerant meshes with minimal numbers of spares
This paper presents several techniques for adding fault-tolerance to distributed memory parallel computers. More formally, given a target graph with n nodes, we create a fault-tol...
Jehoshua Bruck, Robert Cypher, Ching-Tien Ho