Sciweavers

2531 search results - page 296 / 507
» Group testing in graphs
Sort
View
ESA
2005
Springer
162views Algorithms» more  ESA 2005»
16 years 3 days ago
Negative Cycle Detection Problem
In this paper, we will describe some heuristics that can be used to improve the runtime of a wide range of commonly used algorithms for the negative cycle detection problem signiï¬...
Chi-Him Wong, Yiu-Cheong Tam
ISCIS
2005
Springer
16 years 2 days ago
Computing Communities in Large Networks Using Random Walks
Dense subgraphs of sparse graphs (communities), which appear in most real-world complex networks, play an important role in many contexts. Computing them however is generally expe...
Pascal Pons, Matthieu Latapy
SBCCI
2003
ACM
213views VLSI» more  SBCCI 2003»
15 years 12 months ago
Algorithms and Tools for Network on Chip Based System Design
Network on Chip (NoC) is a new paradigm for designing core based System on Chips. It supports high degree of reusability and is scalable. In this paper, an efficient Two-Step Gene...
Tang Lei, Shashi Kumar
SOFTVIS
2003
ACM
15 years 12 months ago
Visualizing Software for Telecommunication Services
An active research area in telecommunications concerns how to specify and control the addition of new services, such as call waiting or instant messaging, into existing software. ...
Emden R. Gansner, John M. Mocenigo, Stephen C. Nor...
ICECCS
1998
IEEE
123views Hardware» more  ICECCS 1998»
15 years 11 months ago
Applying Slicing Technique to Software Architectures
Software architecture is receiving increasingly attention as a critical design level for software systems. As software architecture design resources (in the form of architectural ...
Jianjun Zhao