Sciweavers

1648 search results - page 108 / 330
» On the generation of bicliques of a graph
Sort
View
DLIB
2002
263views more  DLIB 2002»
15 years 1 months ago
Information Retrieval by Semantic Analysis and Visualization of the Concept Space of D-Lib Magazine
In this article we present a method for retrieving documents from a digital library through a visual interface based on automatically generated concepts. We used a vocabulary gene...
Junliang Zhang, Javed Mostafa, Himansu Tripathy
FM
2009
Springer
134views Formal Methods» more  FM 2009»
14 years 11 months ago
Partial Order Reductions Using Compositional Confluence Detection
Abstract. Explicit state methods have proven useful in verifying safetycritical systems containing concurrent processes that run asynchronously and communicate. Such methods consis...
Frédéric Lang, Radu Mateescu
WEBI
2005
Springer
15 years 7 months ago
WICER: A Weighted Inter-Cluster Edge Ranking for Clustered Graphs
Several algorithms based on link analysis have been developed to measure the importance of nodes on a graph such as pages on the World Wide Web. PageRank and HITS are the most pop...
Divya Padmanabhan, Prasanna Kumar Desikan, Jaideep...
DSD
2003
IEEE
138views Hardware» more  DSD 2003»
15 years 7 months ago
A Two-step Genetic Algorithm for Mapping Task Graphs to a Network on Chip Architecture
Network on Chip (NoC) is a new paradigm for designing core based System on Chip which supports high degree of reusability and is scalable. In this paper we describe an efficient t...
Tang Lei, Shashi Kumar
IPPS
1998
IEEE
15 years 6 months ago
Low Memory Cost Dynamic Scheduling of Large Coarse Grain Task Graphs
Schedulinglarge task graphsis an importantissue in parallel computingsince it allowsthe treatment of big size problems. In this paper we tackle the following problem: how to sched...
Michel Cosnard, Emmanuel Jeannot, Laurence Rougeot