Sciweavers

524 search results - page 86 / 105
» On the Maximum Number of Cliques in a Graph
Sort
View
IDEAL
2007
Springer
14 years 1 months ago
PINCoC : A Co-clustering Based Approach to Analyze Protein-Protein Interaction Networks
A novel technique to search for functional modules in a protein-protein interaction network is presented. The network is represented by the adjacency matrix associated with the und...
Clara Pizzuti, Simona E. Rombo
ASPDAC
2006
ACM
116views Hardware» more  ASPDAC 2006»
14 years 1 months ago
Post-routing redundant via insertion for yield/reliability improvement
- Reducing the yield loss due to via failure is one of the important problems in design for manufacturability. A well known and highly recommended method to improve via yield/relia...
Kuang-Yao Lee, Ting-Chi Wang
WG
2005
Springer
14 years 1 months ago
Approximation Algorithms for the Weighted Independent Set Problem
In unweighted case, approximation ratio for the independent set problem has been analyzed in terms of the graph parameters, such as the number of vertices, maximum degree, and aver...
Akihisa Kako, Takao Ono, Tomio Hirata, Magnú...
COCOON
2008
Springer
13 years 9 months ago
The Computational Complexity of Link Building
We study the problem of adding k new links to a directed graph G(V, E) in order to maximize the minimum PageRank value for a given subset of the nodes. We show that this problem is...
Martin Olsen
DICTA
2003
13 years 9 months ago
Automatic Adaptive Segmentation of Moving Objects Based on Spatio-Temporal Information
This paper suggests a novel segmentation algorithm for separating moving objects from the background in video sequences without any prior information of the sequence nature. We for...
Ofer Miller, Amir Averbuch, Yosi Keller