Sciweavers

598 search results - page 100 / 120
» A random graph model for massive graphs
Sort
View
ICALP
2011
Springer
14 years 3 months ago
On the Advice Complexity of the k-Server Problem
Competitive analysis is the established tool for measuring the output quality of algorithms that work in an online environment. Recently, the model of advice complexity has been in...
Hans-Joachim Böckenhauer, Dennis Komm, Rastis...
PDCAT
2005
Springer
15 years 5 months ago
Optimal Routing in a Small-World Network
Recently a bulk of research [14, 5, 15, 9] has been done on the modelling of the smallworld phenomenon, which has been shown to be pervasive in social and nature networks, and eng...
Jianyang Zeng, Wen-Jing Hsu
113
Voted
BMCBI
2007
200views more  BMCBI 2007»
14 years 12 months ago
BNDB - The Biochemical Network Database
Background: Technological advances in high-throughput techniques and efficient data acquisition methods have resulted in a massive amount of life science data. The data is stored ...
Jan Küntzer, Christina Backes, Torsten Blum, ...
DATE
2005
IEEE
115views Hardware» more  DATE 2005»
15 years 5 months ago
Functional Coverage Driven Test Generation for Validation of Pipelined Processors
Functional verification of microprocessors is one of the most complex and expensive tasks in the current system-on-chip design process. A significant bottleneck in the validatio...
Prabhat Mishra, Nikil D. Dutt
COLING
2008
15 years 1 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