Sciweavers

681 search results - page 121 / 137
» General Polynomial Time Decomposition Algorithms
Sort
View
BIBM
2008
IEEE
112views Bioinformatics» more  BIBM 2008»
14 years 4 months ago
Fast Alignments of Metabolic Networks
Network alignments are extensively used for comparing, exploring, and predicting biological networks. Existing alignment tools are mostly based on isomorphic and homeomorphic embe...
Qiong Cheng, Piotr Berman, Robert W. Harrison, Ale...
AH
2004
Springer
14 years 3 months ago
Using SiteRank for Decentralized Computation of Web Document Ranking
Abstract. The PageRank algorithm demonstrates the significance of the computation of document ranking of general importance or authority in Web information retrieval. However, doi...
Jie Wu, Karl Aberer
KDD
2010
ACM
245views Data Mining» more  KDD 2010»
14 years 1 months ago
Flexible constrained spectral clustering
Constrained clustering has been well-studied for algorithms like K-means and hierarchical agglomerative clustering. However, how to encode constraints into spectral clustering rem...
Xiang Wang, Ian Davidson
ISAAC
2009
Springer
169views Algorithms» more  ISAAC 2009»
14 years 4 months ago
The Complexity of Solving Stochastic Games on Graphs
We consider some well-known families of two-player zero-sum perfect-information stochastic games played on finite directed graphs. Generalizing and unifying results of Liggett and...
Daniel Andersson, Peter Bro Miltersen
GLVLSI
2007
IEEE
171views VLSI» more  GLVLSI 2007»
14 years 4 months ago
Combinational equivalence checking for threshold logic circuits
Threshold logic is gaining prominence as an alternative to Boolean logic. The main reason for this trend is the availability of devices that implement these circuits efficiently (...
Tejaswi Gowda, Sarma B. K. Vrudhula, Goran Konjevo...