Sciweavers

1883 search results - page 78 / 377
» Ordered theta graphs
Sort
View
STOC
1990
ACM
108views Algorithms» more  STOC 1990»
13 years 11 months ago
Optimal Randomized Algorithms for Local Sorting and Set-Maxima
We present randomized algorithms for two sorting problems. In the local sorting problem, a graph is given in which each vertex is assigned an element of a total order, and the task...
Wayne Goddard, Valerie King, Leonard J. Schulman
DM
2002
92views more  DM 2002»
13 years 7 months ago
A local-global principle for vertex-isoperimetric problems
We consider the vertex-isoperimetric problem for cartesian powers of a graph G. A total order on the vertex set of G is called isoperimetric if the boundary of sets of a given siz...
Sergei L. Bezrukov, Oriol Serra
SCP
2002
112views more  SCP 2002»
13 years 7 months ago
Formal agent-oriented modeling with UML and graph transformation
The agent paradigm can be seen as an extension of the notion of (active) objects by concepts like autonomy and cooperation. Mainstream object-oriented modeling techniques do not a...
Ralph Depke, Reiko Heckel, Jochen Malte Küste...
IWMMDBMS
1996
88views more  IWMMDBMS 1996»
13 years 9 months ago
Automating the Organization of Presentations for Playout Management in Multimedia Databases
We introduce a constraint-driven methodology for the automated assembly, organization and playout of presentations from multimedia databases. We use inclusion and exclusion constr...
Veli Hakkoymaz, Gultekin Özsoyoglu
ACIVS
2006
Springer
14 years 1 months ago
A Linear-Time Approach for Image Segmentation Using Graph-Cut Measures
Abstract. Image segmentation using graph cuts have become very popular in the last years. These methods are computationally expensive, even with hard constraints (seed pixels). We ...
Alexandre X. Falcão, Paulo A. V. Miranda, A...