Sciweavers

458 search results - page 84 / 92
» Distance graphs: from random geometric graphs to Bernoulli g...
Sort
View
BMCBI
2007
115views more  BMCBI 2007»
13 years 8 months ago
How accurate and statistically robust are catalytic site predictions based on closeness centrality?
Background: We examine the accuracy of enzyme catalytic residue predictions from a network representation of protein structure. In this model, amino acid α-carbons specify vertic...
Eric Chea, Dennis R. Livesay
SWAT
2010
Springer
242views Algorithms» more  SWAT 2010»
13 years 7 months ago
Minimizing the Diameter of a Network Using Shortcut Edges
We study the problem of minimizing the diameter of a graph by adding k shortcut edges, for speeding up communication in an existing network design. We develop constant-factor appro...
Erik D. Demaine, Morteza Zadimoghaddam
ECIR
2011
Springer
13 years 2 days ago
A User-Oriented Model for Expert Finding
Expert finding addresses the problem of retrieving a ranked list of people who are knowledgeable on a given topic. Several models have been proposed to solve this task, but so far...
Elena Smirnova, Krisztian Balog
VLSID
2004
IEEE
292views VLSI» more  VLSID 2004»
14 years 9 months ago
NoCGEN: A Template Based Reuse Methodology for Networks on Chip Architecture
In this paper, we describe NoCGEN, a Network On Chip (NoC) generator, which is used to create a simulatable and synthesizable NoC description. NoCGEN uses a set of modularised rou...
Jeremy Chan, Sri Parameswaran
COLING
2008
13 years 10 months ago
An Integrated Probabilistic and Logic Approach to Encyclopedia Relation Extraction with Multiple Features
We propose a new integrated approach based on Markov logic networks (MLNs), an effective combination of probabilistic graphical models and firstorder logic for statistical relatio...
Xiaofeng Yu, Wai Lam