Sciweavers

275 search results - page 17 / 55
» Component factors with large components in graphs
Sort
View
SEMWEB
2010
Springer
14 years 9 months ago
Compact Representation of Large RDF Data Sets for Publishing and Exchange
Abstract. Increasingly huge RDF data sets are being published on the Web. Currently, they use different syntaxes of RDF, contain high levels of redundancy and have a plain indivisi...
Javier D. Fernández, Miguel A. Martí...
GIS
2006
ACM
16 years 21 days ago
Recognition of island structures for map generalization
In this paper we describe work on the automatic recognition of island structures. In an initial phase several test persons were asked to mark groups of islands that they perceived...
Stefan Steiniger, Dirk Burghardt, Robert Weibel
94
Voted
BIOINFORMATICS
2007
83views more  BIOINFORMATICS 2007»
14 years 11 months ago
Exploring biological network structure using exponential random graph models
Motivation: The functioning of biological networks depends in large part on their complex underlying structure. When studying their systemic nature many modeling approaches focus ...
Zachary M. Saul, Vladimir Filkov
80
Voted
JCO
2006
128views more  JCO 2006»
14 years 11 months ago
A combinatorial theorem on labeling squares with points and its application
In this paper, we present a combinatorial theorem on labeling disjoint axis-parallel squares of edge length two using points. Given an arbitrary set of disjoint axis-parallel squar...
Binhai Zhu, Minghui Jiang
KDD
2001
ACM
253views Data Mining» more  KDD 2001»
16 years 2 days ago
GESS: a scalable similarity-join algorithm for mining large data sets in high dimensional spaces
The similarity join is an important operation for mining high-dimensional feature spaces. Given two data sets, the similarity join computes all tuples (x, y) that are within a dis...
Jens-Peter Dittrich, Bernhard Seeger