Sciweavers

1477 search results - page 115 / 296
» On Graph Problems in a Semi-streaming Model
Sort
View
71
Voted
IV
2005
IEEE
81views Visualization» more  IV 2005»
15 years 3 months ago
A New Force-Directed Graph Drawing Method Based on Edge-Edge Repulsion
The conventional force-directed methods for drawing undirected graphs are based on either vertex-vertex repulsion or vertex-edge repulsion. In this paper, we propose a new force-d...
Chun-Cheng Lin, Hsu-Chun Yen
90
Voted
ICML
2004
IEEE
15 years 11 months ago
Kernel conditional random fields: representation and clique selection
Kernel conditional random fields (KCRFs) are introduced as a framework for discriminative modeling of graph-structured data. A representer theorem for conditional graphical models...
John D. Lafferty, Xiaojin Zhu, Yan Liu
IPPS
1998
IEEE
15 years 2 months ago
Multiprocessor Scheduling Using Mean-Field Annealing
This paper presents our work on the static task scheduling model using the mean-field annealing (MFA) technique. Mean-field annealing is a technique of thermostatic annealing that...
Shaharuddin Salleh, Albert Y. Zomaya
ISBI
2009
IEEE
15 years 5 months ago
Cell Tracking and Segmentation in Electron Microscopy Images Using Graph Cuts
Understanding neural connectivity and structures in the brain requires detailed 3D anatomical models, and such an understanding is essential to the study of the nervous system. Ho...
Huei-Fang Yang, Yoonsuck Choe
CGI
2004
IEEE
15 years 2 months ago
Consistent Normal Orientation for Polygonal Meshes
In this paper, we propose a new method that can consistently orient all normals of any mesh (if at all possible), while ensuring that most polygons are seen with their front-faces...
Pavel Borodin, Gabriel Zachmann, Reinhard Klein