515 search results - page 76 / 103 » Layouts of Expander Graphs |
93
Voted
CCCG
2007
15 years 2 months ago
2007
Given a sequence of n real numbers a1, a2, a3, . . . , an, the maximum segment sum problem is that of determining indices i and j (1 ≤ i ≤ j ≤ n) such that the sum s(i, j) =...
116
Voted
AAAI
2004
15 years 2 months ago
2004
A growing number of applications seek to incorporate automatically generated narrative structure into interactive virtual environments. In this paper, we evaluate a representation...
94
Voted
IANDC
2006
15 years 20 days ago
2006
We study several algebras of graphs and hypergraphs and the corresponding notions of equational sets and recognizable sets. We generalize and unify several existing results which ...
100
Voted
SAMOS
2010
Springer
14 years 11 months ago
2010
Springer
Abstract—In this paper we present a Multithreaded programming methodology for multi-core systems that utilizes DataFlow concurrency. The programmer augments the program with macr...
119
Voted
CVPR
2010
IEEE
15 years 9 months ago
2010
IEEE
We present a method to segment a collection of unlabeled images while exploiting automatically discovered appearance patterns shared between them. Given an unlabeled pool of multi...