Sciweavers

1027 search results - page 140 / 206
» Ordered Vertex Partitioning
Sort
View
WAW
2010
Springer
306views Algorithms» more  WAW 2010»
13 years 6 months ago
Finding and Visualizing Graph Clusters Using PageRank Optimization
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...
Fan Chung Graham, Alexander Tsiatas
CORR
2009
Springer
74views Education» more  CORR 2009»
13 years 6 months ago
Parallelizing Deadlock Resolution in Symbolic Synthesis of Distributed Programs
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...
Fuad Abujarad, Borzoo Bonakdarpour, Sandeep S. Kul...
EACL
2009
ACL Anthology
13 years 6 months ago
Optimization in Coreference Resolution is not Needed: A Nearly-Optimal Algorithm with Intensional Constraints
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...
Manfred Klenner, Étienne Ailloud
CORR
2010
Springer
120views Education» more  CORR 2010»
13 years 3 months ago
LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations
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...
Jérémy Barbay, Johannes Fischer
MCPR2
2011
104views more  MCPR2 2011»
12 years 11 months ago
People Detection Using Color and Depth Images
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...
Joaquín Salas, Carlo Tomasi