Sciweavers

486 search results - page 21 / 98
» Parallel Algorithms for Relational Coarsest Partition Proble...
Sort
View
PAMI
2010
112views more  PAMI 2010»
13 years 6 months ago
Polynomial Time Algorithms for Ratio Regions and a Variant of Normalized Cut
—In partitioning, clustering, and grouping problems, a typical goal is to group together similar objects, or pixels in the case of image processing. At the same time, another goa...
Dorit S. Hochbaum
LCTRTS
2009
Springer
14 years 2 months ago
Synergistic execution of stream programs on multicores with accelerators
The StreamIt programming model has been proposed to exploit parallelism in streaming applications on general purpose multicore architectures. The StreamIt graphs describe task, da...
Abhishek Udupa, R. Govindarajan, Matthew J. Thazhu...
IPPS
2005
IEEE
14 years 1 months ago
A Framework for Partitioning Computational Intensive Applications in Hybrid Reconfigurable Platforms
In this paper, we describe a prototype software framework that implements a formalized methodology for partitioning computational intensive applications between reconfigurable har...
Michalis D. Galanis, Athanasios Milidonis, George ...
ISAAC
2004
Springer
103views Algorithms» more  ISAAC 2004»
14 years 1 months ago
Structural Similarity in Graphs (A Relaxation Approach for Role Assignment)
Standard methods for role assignment partition the vertex set of a graph in such a way that vertices in the same class can be considered to have equivalent roles in the graph. Seve...
Ulrik Brandes, Jürgen Lerner
DATESO
2010
132views Database» more  DATESO 2010»
13 years 5 months ago
Two-step Modified SOM for Parallel Calculation
This paper presents a simple modification of classic Kohonen network (SOM), which allows parallel processing of input data vectors or partitioning the problem in case of insufficie...
Petr Gajdos, Pavel Moravec