Sciweavers

187 search results - page 18 / 38
» On the Natural Imprint Function of a Graph
Sort
View
JCT
2011
90views more  JCT 2011»
15 years 27 days ago
Small subgraphs in random graphs and the power of multiple choices
The standard paradigm for online power of two choices problems in random graphs is the Achlioptas process. Here we consider the following natural generalization: Starting with G0 a...
Torsten Mütze, Reto Spöhel, Henning Thom...
SDM
2007
SIAM
177views Data Mining» more  SDM 2007»
15 years 7 months ago
Multi-way Clustering on Relation Graphs
A number of real-world domains such as social networks and e-commerce involve heterogeneous data that describes relations between multiple classes of entities. Understanding the n...
Arindam Banerjee, Sugato Basu, Srujana Merugu
GECCO
2009
Springer
15 years 10 months ago
Using simulated annealing for producing software architectures
Automatic design of software architecture by use of genetic algorithms has already been shown to be feasible. A natural problem is to augment – if not replace – genetic algori...
Outi Räihä, Erkki Mäkinen, Timo Por...
ICCV
1999
IEEE
16 years 7 months ago
Fast Approximate Energy Minimization via Graph Cuts
In this paper we address the problem of minimizing a large class of energy functions that occur in early vision. The major restriction is that the energy function's smoothnes...
Yuri Boykov, Olga Veksler, Ramin Zabih
SODA
2004
ACM
121views Algorithms» more  SODA 2004»
15 years 7 months ago
A characterization of easily testable induced subgraphs
Let H be a fixed graph on h vertices. We say that a graph G is induced H-free if it does not contain any induced copy of H. Let G be a graph on n vertices and suppose that at leas...
Noga Alon, Asaf Shapira