Sciweavers

2034 search results - page 240 / 407
» On the Comparability of Software Clustering Algorithms
Sort
View
IDEAL
2009
Springer
15 years 11 months ago
A Framework for Pattern-Based Global Models
Abstract. Discovering global models on a dataset (e.g., classifiers, clusterings, summaries) has attracted a lot of attention and many approaches can be found in the literature. H...
Arnaud Giacometti, Eynollah Khanjari Miyaneh, Patr...
WEBI
2009
Springer
15 years 11 months ago
Summarizing Documents by Measuring the Importance of a Subset of Vertices within a Graph
— This paper presents a novel method of generating extractive summaries for multiple documents. Given a cluster of documents, we firstly construct a graph where each vertex repre...
Shouyuan Chen, Minlie Huang, Zhiyong Lu
JSSPP
2001
Springer
15 years 11 months ago
Coscheduling under Memory Constraints in a NOW Environment
Networks of Workstations (NOW) have become important and cost-effective parallel platforms for scientific computations. In practice, a NOW system is heterogeneous and non-dedicat...
Francesc Giné, Francesc Solsona, Porfidio H...
PVM
1998
Springer
15 years 10 months ago
Load Balancing for Network Based Multi-threaded Applications
In this paper we present Lbs, a load-management-system for network based concurrent computing. The system is built on Pt-Pvm, a library based on the PVM system. Pt-Pvm provides mes...
Oliver Krone, Martin Raab, Béat Hirsbrunner
ISLPED
1997
ACM
96views Hardware» more  ISLPED 1997»
15 years 10 months ago
Re-mapping for low power under tight timing constraints
In this paper1 we propose a novel approach to synthesis for low power under tight timing constraints. Starting from a mapped netlist, we apply a powerful generalized matching algo...
Patrick Vuillod, Luca Benini, Giovanni De Micheli