1027 search results - page 140 / 206 » Ordered Vertex Partitioning |
163
click to vote
WAW
2010
Springer
15 years 1 months ago
2010
Springer
We give algorithms for finding graph clusters and drawing graphs, highlighting local community structure within the context of a larger network. For a given graph G, we use the per...
100
click to vote
CORR
2009
Springer
15 years 1 months ago
2009
Springer
Previous work has shown that there are two major complexity barriers in the synthesis of fault-tolerant distributed programs, namely generation of fault-span, the set of states re...
140
Voted
EACL
2009
ACL Anthology
15 years 1 months ago
2009
ACL Anthology
We show how global constraints such as transitivity can be treated intensionally in a Zero-One Integer Linear Programming (ILP) framework which is geared to find the optimal and c...
123
click to vote
CORR
2010
Springer
14 years 10 months ago
2010
Springer
LRM-Trees are an elegant way to partition a sequence of values into sorted consecutive blocks, and to express the relative position of the first element of each block within a prev...
132
click to vote
MCPR2
2011
14 years 6 months ago
2011
We present a strategy that combines color and depth images to detect people in indoor environments. Similarity of image appearance and closeness in 3D position over time yield weig...