Sciweavers

415 search results - page 42 / 83
» Optimally Reconstructing Weighted Graphs Using Queries
Sort
View
ICML
2007
IEEE
14 years 9 months ago
Parameter learning for relational Bayesian networks
We present a method for parameter learning in relational Bayesian networks (RBNs). Our approach consists of compiling the RBN model into a computation graph for the likelihood fun...
Manfred Jaeger
ICDE
2009
IEEE
133views Database» more  ICDE 2009»
14 years 3 months ago
STAR: Steiner-Tree Approximation in Relationship Graphs
— Large graphs and networks are abundant in modern information systems: entity-relationship graphs over relational data or Web-extracted entities, biological networks, social onl...
Gjergji Kasneci, Maya Ramanath, Mauro Sozio, Fabia...
SIGMOD
2009
ACM
182views Database» more  SIGMOD 2009»
14 years 9 months ago
3-HOP: a high-compression indexing scheme for reachability query
Reachability queries on large directed graphs have attracted much attention recently. The existing work either uses spanning structures, such as chains or trees, to compress the c...
Ruoming Jin, Yang Xiang, Ning Ruan, David Fuhry
SMI
2006
IEEE
121views Image Analysis» more  SMI 2006»
14 years 3 months ago
Minimum Ratio Contours on Surface Meshes
We present a novel approach for discretely optimizing contours on the surface of a triangle mesh. This is achieved through the use of a minimum ratio cycle (MRC) algorithm, where ...
Andrew Clements, Hao Zhang 0002
STOC
2006
ACM
166views Algorithms» more  STOC 2006»
14 years 9 months ago
New upper and lower bounds for randomized and quantum local search
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
Shengyu Zhang