3220 search results - page 20 / 644 » Constrained Graph Processes |
147
Voted
DATE
1999
IEEE
15 years 9 months ago
1999
IEEE
Commonly used scheduling algorithms in high-level synthesis only accept one process at a time and are not capable of sharing resources across process boundaries. This results in t...
136
click to vote
ICPR
2008
IEEE
15 years 11 months ago
2008
IEEE
In this work we present a novel method to model instance-level constraints within a clustering algorithm. Thereby, both similarity and dissimilarity constraints can be used coeval...
164
click to vote
ALGORITHMICA
2008
15 years 5 months ago
2008
Grid computing systems pool together the resources of many workstations to create a virtual computing reservoir. Users can "draw" resources using a pay-as-you-go model, c...
175
click to vote
SODA
1992
ACM
15 years 6 months ago
1992
ACM
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...
189
click to vote
ICDM
2008
IEEE
15 years 11 months ago
2008
IEEE
OLAP (On-Line Analytical Processing) is an important notion in data analysis. Recently, more and more graph or networked data sources come into being. There exists a similar need ...