Sciweavers

429 search results - page 10 / 86
» Solving the Maximum Clique Problem Using PUBB
Sort
View
NIPS
2001
13 years 9 months ago
Matching Free Trees with Replicator Equations
Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an association...
Marcello Pelillo
NETWORKS
2008
13 years 7 months ago
Reformulation and sampling to solve a stochastic network interdiction problem
The Network Interdiction Problem involves interrupting an adversary's ability to maximize flow through a capacitated network by destroying portions of the network. A budget c...
Udom Janjarassuk, Jeff Linderoth
ISCAS
2002
IEEE
65views Hardware» more  ISCAS 2002»
14 years 17 days ago
Maximum achievable energy reduction using coding with applications to deep sub-micron buses
: In this work, the problem of the computation of the minimum energy per bit required for communicating through deep sub-micron buses at a given bit rate is solved with an explicit...
Paul-Peter Sotiriadis, Anantha Chandrakasan, Vahid...
SWAT
1994
Springer
113views Algorithms» more  SWAT 1994»
13 years 11 months ago
Trapezoid Graphs and Generalizations, Geometry and Algorithms
Trapezoid graphs are a class of cocomparability graphs containing interval graphs and permutation graphs as subclasses. They were introduced by Dagan, Golumbic and Pinter DGP]. Th...
Stefan Felsner, Rudolf Müller, Lorenz Wernisc...
EMMCVPR
2011
Springer
12 years 7 months ago
SlimCuts: GraphCuts for High Resolution Images Using Graph Reduction
Abstract. This paper proposes an algorithm for image segmentation using GraphCuts which can be used to efficiently solve labeling problems on high resolution images or resource-lim...
Björn Scheuermann, Bodo Rosenhahn