Sciweavers

108 search results - page 15 / 22
» On Computing the Centroid of the Vertices of an Arrangement ...
Sort
View
ICDE
2010
IEEE
311views Database» more  ICDE 2010»
14 years 4 months ago
Detecting Inconsistencies in Distributed Data
— One of the central problems for data quality is inconsistency detection. Given a database D and a set Σ of dependencies as data quality rules, we want to identify tuples in D ...
Wenfei Fan, Floris Geerts, Shuai Ma, Heiko Mü...
BMCBI
2010
104views more  BMCBI 2010»
13 years 7 months ago
FragViz: visualization of fragmented networks
Background: Researchers in systems biology use network visualization to summarize the results of their analysis. Such networks often include unconnected components, which popular ...
Miha Stajdohar, Minca Mramor, Blaz Zupan, Janez De...
COCOA
2011
Springer
12 years 7 months ago
Algorithmic Aspects of Heterogeneous Biological Networks Comparison
Biological networks are commonly used to model molecular activity within the cell. Recent experimental studies have shown that the detection of conserved subnetworks across several...
Guillaume Blin, Guillaume Fertin, Hafedh Mohamed-B...
CVPR
2008
IEEE
14 years 9 months ago
Probabilistic graph and hypergraph matching
We consider the problem of finding a matching between two sets of features, given complex relations among them, going beyond pairwise. Each feature set is modeled by a hypergraph ...
Ron Zass, Amnon Shashua
COMBINATORICS
2007
72views more  COMBINATORICS 2007»
13 years 7 months ago
Matrix Partitions with Finitely Many Obstructions
Each m by m symmetric matrix M over 0, 1, ∗, defines a partition problem, in which an input graph G is to be partitioned into m parts with adjacencies governed by M, in the sen...
Tomás Feder, Pavol Hell, Wing Xie