Sciweavers

439 search results - page 31 / 88
» Engineering Comparators for Graph Clusterings
Sort
View
CN
2000
107views more  CN 2000»
13 years 7 months ago
Query routing for Web search engines: architecture and experiments
General-purpose search engines such as AltaVista and Lycos are notorious for returning irrelevant results in response to user queries. Consequently, thousands of specialized, topi...
Atsushi Sugiura, Oren Etzioni
WEBI
2009
Springer
14 years 10 days 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
EUROMICRO
1998
IEEE
14 years 2 days ago
SMP PCs: A Case Study on Cluster Computing
As commodity microprocessors and networks reach performance levels comparable to those used in massively parallel processors, clusters of symmetric multiprocessors are starting to...
Antônio Augusto Fröhlich, Wolfgang Schr...
IWPC
2006
IEEE
14 years 1 months ago
Studying the Evolution of Software Systems Using Change Clusters
In this paper, we present an approach that examines the evolution of code stored in source control repositories. The technique identifies Change Clusters, which can help managers...
Jay Kothari, Ali Shokoufandeh, Spiros Mancoridis, ...
WCRE
2007
IEEE
14 years 2 months ago
Dynamic Protocol Recovery
Dynamic protocol recovery tries to recover a component’s sequencing constraints by means of dynamic analysis. This problem has been tackled by several automaton learning approac...
Jochen Quante, Rainer Koschke