1172 search results - page 104 / 235 » Path Algorithms on Regular Graphs |
ICPR
2008
IEEE
15 years 7 months ago
2008
IEEE
In this work we present a novel method to model instance-level constraints within a clustering algorithm. Thereby, both similarity and dissimilarity constraints can be used coeval...
118
Voted
FCT
2009
Springer
15 years 4 months ago
2009
Springer
We show that the reachability problem for directed graphs that are either K3,3-free or K5-free is in unambiguous log-space, UL coUL. This significantly extends the result of Bour...
108
Voted
OPODIS
2007
15 years 2 months ago
2007
Abstract. We consider the distributed construction of a minimum weight 2edge-connected spanning subgraph (2-ECSS) of a given weighted or unweighted graph. A 2-ECSS of a graph is a ...
104
click to vote
SEFM
2008
IEEE
15 years 7 months ago
2008
IEEE
We present an approach to find upper bounds of heap space for Java Card applets. Our method first transforms an input bytecode stream into a control flow graph (CFG), and then ...
100
Voted
ICML
2006
IEEE
16 years 1 months ago
2006
IEEE
In ranking, one is given examples of order relationships among objects, and the goal is to learn from these examples a real-valued ranking function that induces a ranking or order...