Sciweavers

3341 search results - page 243 / 669
» Managing a Large
Sort
View
WEA
2007
Springer
111views Algorithms» more  WEA 2007»
16 years 1 months ago
Vertex Cover Approximations on Random Graphs
Abstract. The vertex cover problem is a classical NP-complete problem for which the best worst-case approximation ratio is 2− o(1). In this paper, we use a collection of simple g...
Eyjolfur Asgeirsson, Clifford Stein
CSMR
2006
IEEE
16 years 1 months ago
Can LSI help Reconstructing Requirements Traceability in Design and Test?
Managing traceability data is an important aspect of the software development process. In this paper we investigate to what extent latent semantic indexing (LSI), an information r...
Marco Lormans, Arie van Deursen
EAGC
2004
Springer
16 years 20 days ago
Connecting Condor Pools into Computational Grids by Jini
This paper describes how Condor-pools could be joined together to form a large computational cluster-grid. In the architecture Jini provides the infrastructure for resource lookup,...
Gergely Sipos, Péter Kacsuk
CA
2002
IEEE
16 years 7 days ago
Homotopic Database Animation
Very large databases on the Web have been changing dynamically and have become complicated today. This research aims at helping users’ understanding of database changes by datab...
Toshio Kodama, Tosiyasu L. Kunii
DATE
2002
IEEE
103views Hardware» more  DATE 2002»
16 years 7 days ago
Communication Mechanisms for Parallel DSP Systems on a Chip
We consider the implication of deep sub-micron VLSI technology on the design of communication frameworks for parallel DSP systems-on-chip. We assert that distributed data transfer...
Joseph Williams, Nevin Heintze, Bryan D. Ackland