Sciweavers

375 search results - page 65 / 75
» An Algorithm to Find Overlapping Community Structure in Netw...
Sort
View
BMCBI
2005
198views more  BMCBI 2005»
13 years 7 months ago
Clustering protein sequences with a novel metric transformed from sequence similarity scores and sequence alignments with neural
Background: The sequencing of the human genome has enabled us to access a comprehensive list of genes (both experimental and predicted) for further analysis. While a majority of t...
Qicheng Ma, Gung-Wei Chirn, Richard Cai, Joseph D....
ARC
2007
Springer
102views Hardware» more  ARC 2007»
13 years 11 months ago
Reconfigurable Hardware Acceleration of Canonical Graph Labelling
Many important algorithms in computational biology and related subjects rely on the ability to extract and to identify sub-graphs of larger graphs; an example is to find common fun...
David B. Thomas, Wayne Luk, Michael Stumpf
HIPC
2007
Springer
13 years 11 months ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri
ICDE
2007
IEEE
170views Database» more  ICDE 2007»
14 years 8 months ago
Tree-Pattern Similarity Estimation for Scalable Content-based Routing
With the advent of XML as the de facto language for data publishing and exchange, scalable distribution of XML data to large, dynamic populations of consumers remains an important...
Raphaël Chand, Pascal Felber, Minos N. Garofa...
STOC
2005
ACM
135views Algorithms» more  STOC 2005»
14 years 7 months ago
On the bias of traceroute sampling: or, power-law degree distributions in regular graphs
Understanding the graph structure of the Internet is a crucial step for building accurate network models and designing efficient algorithms for Internet applications. Yet, obtaini...
Dimitris Achlioptas, Aaron Clauset, David Kempe, C...