4926 search results - page 142 / 986 » Two Graph Algorithms On an Associative Computing Model |
131
click to vote
STOC
1990
ACM
15 years 9 months ago
1990
ACM
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...
194
click to vote
JCSC
1998
15 years 4 months ago
1998
: Continuous and hybrid Petri nets can be seen as relaxation of discrete nets, in which the firing of some or of all transitions is approximated with a fluid model. Several analysi...
150
Voted
CIE
2008
Springer
15 years 6 months ago
2008
Springer
The values of a two-player zero-sum binary discounted game are characterized by a P-matrix linear complementarity problem (LCP). Simple formulas are given to describe the data of t...
130
click to vote
CVPR
2005
IEEE
16 years 7 months ago
2005
IEEE
The recent explosion of interest in graph cut methods in computer vision naturally spawns the question: what energy functions can be minimized via graph cuts? This question was fi...
142
click to vote
JMLR
2011
14 years 12 months ago
2011
Following Hartigan (1975), a cluster is defined as a connected component of the t-level set of the underlying density, that is, the set of points for which the density is greater...