Sciweavers

515 search results - page 76 / 103
» Layouts of Expander Graphs
Sort
View
CCCG
2007
14 years 3 days ago
On a Geometric Approach to the Segment Sum Problem and Its Generalization
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) =...
Asish Mukhopadhyay, Eugene Greene
AAAI
2004
14 years 1 days ago
Comparing Cognitive and Computational Models of Narrative Structure
A growing number of applications seek to incorporate automatically generated narrative structure into interactive virtual environments. In this paper, we evaluate a representation...
David B. Christian, R. Michael Young
IANDC
2006
82views more  IANDC 2006»
13 years 10 months ago
Recognizability, hypergraph operations, and logical types
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 ...
Achim Blumensath, Bruno Courcelle
SAMOS
2010
Springer
13 years 9 months ago
Programming multi-core architectures using Data-Flow techniques
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...
Samer Arandi, Paraskevas Evripidou
CVPR
2010
IEEE
14 years 6 months ago
Collect-Cut: Segmentation with Top-Down Cues Discovered in Multi-Object Images
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...
Yong Jae Lee, Kristen Grauman