Sciweavers

5606 search results - page 522 / 1122
» Randomization Techniques for Graphs.
Sort
View
ESA
1994
Springer
139views Algorithms» more  ESA 1994»
15 years 11 months ago
A Simple Min Cut Algorithm
We present an algorithm for finding the minimum cut of an undirected edge-weighted graph. It is simple in every respect. It has a short and compact description, is easy to implemen...
Mechthild Stoer, Frank Wagner
FASE
2008
Springer
15 years 8 months ago
Translating Model Simulators to Analysis Models
We present a novel approach for the automatic generation of model-to-model transformations given a description of the operational semantics of the source language by means of graph...
Juan de Lara, Hans Vangheluwe
NIPS
2008
15 years 8 months ago
Dimensionality Reduction for Data in Multiple Feature Representations
In solving complex visual learning tasks, adopting multiple descriptors to more precisely characterize the data has been a feasible way for improving performance. These representa...
Yen-Yu Lin, Tyng-Luh Liu, Chiou-Shann Fuh
FLAIRS
2006
15 years 8 months ago
Methods for Constructing Balanced Elimination Trees and Other Recursive Decompositions
A conditioning graph is a form of recursive factorization which minimizes the memory requirements and simplifies the implementation of inference in Bayesian networks. The time com...
Kevin Grant, Michael C. Horsch
CASCON
2000
99views Education» more  CASCON 2000»
15 years 8 months ago
A multi-perspective software visualization environment
This paper describes a multi-perspective software visualization environment, SHriMP, which combines single view and multi-view techniques to support software exploration at both t...
Jingwei Wu, Margaret-Anne D. Storey