Sciweavers

1327 search results - page 251 / 266
» Path following algorithm for the graph matching problem
Sort
View
128
Voted
BMCBI
2006
120views more  BMCBI 2006»
15 years 1 months ago
Projections for fast protein structure retrieval
Background: In recent times, there has been an exponential rise in the number of protein structures in databases e.g. PDB. So, design of fast algorithms capable of querying such d...
Sourangshu Bhattacharya, Chiranjib Bhattacharyya, ...
108
Voted
PODC
2005
ACM
15 years 7 months ago
Routing complexity of faulty networks
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
Omer Angel, Itai Benjamini, Eran Ofek, Udi Wieder
FPGA
2010
ACM
232views FPGA» more  FPGA 2010»
15 years 1 months ago
High-throughput bayesian computing machine with reconfigurable hardware
We use reconfigurable hardware to construct a high throughput Bayesian computing machine (BCM) capable of evaluating probabilistic networks with arbitrary DAG (directed acyclic gr...
Mingjie Lin, Ilia Lebedev, John Wawrzynek
INFOCOM
2007
IEEE
15 years 8 months ago
Acyclic Type of Relationships Between Autonomous Systems
Abstract— The Internet connectivity in the Autonomous System (AS) level reflects the commercial relationship between ASes. A connection between two ASes could be of type custome...
Rami Cohen, Danny Raz
INFOCOM
2007
IEEE
15 years 8 months ago
A Framework for Multi-Objective SLA Compliance Monitoring
Abstract— Service level agreements (SLAs) specify performance guarantees made by service providers, typically in terms of packet loss, delay, delay variation, and network availab...
Joel Sommers, Paul Barford, Nick G. Duffield, Amos...