Sciweavers

942 search results - page 82 / 189
» Constraints in Graph Drawing Algorithms
Sort
View
IPMU
2010
Springer
13 years 12 months ago
The Link Prediction Problem in Bipartite Networks
We define and study the link prediction problem in bipartite networks, specializing general link prediction algorithms to the bipartite case. In a graph, a link prediction functio...
Jérôme Kunegis, Ernesto William De Lu...
JAIR
2000
94views more  JAIR 2000»
13 years 9 months ago
Planning Graph as a (Dynamic) CSP: Exploiting EBL, DDB and other CSP Search Techniques in Graphplan
This paper reviews the connections between Graphplan's planning-graph and the dynamic constraint satisfaction problem and motivates the need for adapting CSP search technique...
Subbarao Kambhampati
CVIU
2008
180views more  CVIU 2008»
13 years 10 months ago
Topology cuts: A novel min-cut/max-flow algorithm for topology preserving segmentation in N-D images
Topology is an important prior in many image segmentation tasks. In this paper, we design and implement a novel graph-based min-cut/max-flow algorithm that incorporates topology p...
Yun Zeng, Dimitris Samaras, Wei Chen, Qunsheng Pen...
ATAL
2008
Springer
13 years 12 months ago
Evaluating the performance of DCOP algorithms in a real world, dynamic problem
Complete algorithms have been proposed to solve problems modelled as distributed constraint optimization (DCOP). However, there are only few attempts to address real world scenari...
Robert Junges, Ana L. C. Bazzan
VL
1992
IEEE
192views Visual Languages» more  VL 1992»
14 years 2 months ago
Graphic Object Layout with Interactive Genetic Algorithms
Automatic graphic objectlayout methods havelong been studied in many application areas in which graphic objects should be laid out to satisfy the constraints specific to each appl...
Toshiyuki Masui