Sciweavers

1477 search results - page 36 / 296
» On Graph Problems in a Semi-streaming Model
Sort
View
PVLDB
2010
152views more  PVLDB 2010»
14 years 8 months ago
k-Nearest Neighbors in Uncertain Graphs
Complex networks, such as biological, social, and communication networks, often entail uncertainty, and thus, can be modeled as probabilistic graphs. Similar to the problem of sim...
Michalis Potamias, Francesco Bonchi, Aristides Gio...
ER
1993
Springer
163views Database» more  ER 1993»
15 years 1 months ago
Using Conceptual Graph Theory to Support Schema Integration
Two major problems in schema integration are to identify correspondences between different conceptual schemas and to verify that the proposed correspondences are consistent with th...
Paul Johannesson
CORR
2010
Springer
100views Education» more  CORR 2010»
14 years 9 months ago
Shortest paths between shortest paths and independent sets
We study problems of reconguration of shortest paths in graphs. We prove that the shortest reconguration sequence can be exponential in the size of the graph and that it is NP-hard...
Marcin Kaminski, Paul Medvedev, Martin Milanic
IJCAI
1989
14 years 11 months ago
Reasoning About Assumptions in Graphs of Models
Solving design and analysis problems in physical worlds requires the representatio n of large amounts of knowledge. Recently, there has been much interest in explicitly making ass...
Sanjaya Addanki, Roberto Cremonini, J. Scott Penbe...
UAI
2004
14 years 11 months ago
Convolutional Factor Graphs as Probabilistic Models
Based on a recent development in the area of error control coding, we introduce the notion of convolutional factor graphs (CFGs) as a new class of probabilistic graphical models. ...
Yongyi Mao, Frank R. Kschischang, Brendan J. Frey