Sciweavers

5606 search results - page 367 / 1122
» Randomization Techniques for Graphs.
Sort
View
APVIS
2010
15 years 8 months ago
GMap: Visualizing graphs and clusters as maps
Information visualization is essential in making sense out of large data sets. Often, high-dimensional data are visualized as a collection of points in 2-dimensional space through...
Emden R. Gansner, Yifan Hu, Stephen G. Kobourov
CVPR
1997
IEEE
16 years 8 months ago
Global Training of Document Processing Systems Using Graph Transformer Networks
We propose a new machine learning paradigm called Graph Transformer Networks that extends the applicability of gradient-based learning algorithms to systems composed of modules th...
Léon Bottou, Yoshua Bengio, Yann LeCun
MICCAI
2009
Springer
16 years 3 months ago
Multiple Sclerosis Lesion Segmentation Using an Automatic Multimodal Graph Cuts
Abstract. Graph Cuts have been shown as a powerful interactive segmentation technique in several medical domains. We propose to automate the Graph Cuts in order to automatically se...
Daniel García-Lorenzo, Jérémy...
ISSS
2000
IEEE
144views Hardware» more  ISSS 2000»
15 years 11 months ago
Efficient Hardware Controller Synthesis for Synchronous Dataflow Graph in System Level Design
This paper concerns automatic hardware synthesis from data flow graph (DFG) specification in system level design. In the presented design methodology, each node of a data flow gra...
Hyunuk Jung, Kangnyoung Lee, Soonhoi Ha
PODC
2010
ACM
15 years 8 months ago
Brief announcement: efficient graph algorithms without synchronization
We give a graph decomposition technique that creates entirely independent subproblems for graph problems such as coloring and dominating sets that can be solved without synchroniz...
Johannes Schneider, Roger Wattenhofer