Sciweavers

5606 search results - page 204 / 1122
» Randomization Techniques for Graphs.
Sort
View
89
Voted
FLAIRS
2004
15 years 2 months ago
Random Subspacing for Regression Ensembles
In this work we present a novel approach to ensemble learning for regression models, by combining the ensemble generation technique of random subspace method with the ensemble int...
Niall Rooney, David W. Patterson, Sarab S. Anand, ...
ECCV
2002
Springer
16 years 2 months ago
What Energy Functions Can Be Minimized via Graph Cuts?
In the last few years, several new algorithms based on graph cuts have been developed to solve energy minimization problems in computer vision. Each of these techniques constructs...
Vladimir Kolmogorov, Ramin Zabih
DIS
2007
Springer
15 years 4 months ago
Time and Space Efficient Discovery of Maximal Geometric Graphs
A geometric graph is a labeled graph whose vertices are points in the 2D plane with an isomorphism invariant under geometric transformations such as translation, rotation, and scal...
Hiroki Arimura, Takeaki Uno, Shinichi Shimozono
100
Voted
EDBT
2008
ACM
160views Database» more  EDBT 2008»
15 years 2 months ago
Taxonomy-superimposed graph mining
New graph structures where node labels are members of hierarchically organized ontologies or taxonomies have become commonplace in different domains, e.g., life sciences. It is a ...
Ali Cakmak, Gultekin Özsoyoglu
CORR
2008
Springer
136views Education» more  CORR 2008»
15 years 25 days ago
Matrix Graph Grammars
Graph transformation is concerned with the manipulation of graphs by means of rules. Graph grammars have been traditionally studied using techniques from category theory. In previ...
Pedro Pablo Pérez Velasco