486 search results - page 72 / 98 » Parallel Algorithms for Relational Coarsest Partition Proble... |
ICDE
2009
IEEE
14 years 2 months ago
2009
IEEE
— Given a large graph and a set of objects, the task of object connection discovery is to find a subgraph that retains the best connection between the objects. Object connection...
CASC
2007
Springer
14 years 1 months ago
2007
Springer
We introduce the concept of comprehensive triangular decomposition (CTD) for a parametric polynomial system F with coefficients in a field. In broad words, this is a finite part...
GPC
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. Large-scale distributed computing applications require concurrent programming models that support modular and compositional software development. The actor model supports...
ICPADS
2006
IEEE
14 years 1 months ago
2006
IEEE
—Recently, high-end reconfigurable computing systems that employ Field-Programmable Gate Arrays (FPGAs) as hardware accelerators for general-purpose processors have been built. T...
DATE
2005
IEEE
14 years 1 months ago
2005
IEEE
Conventional cache models are not suited for real-time parallel processing because tasks may flush each other’s data out of the cache in an unpredictable manner. In this way th...