Sciweavers

969 search results - page 67 / 194
» A New Metric Between Polygons and How to Compute it
Sort
View
BIOINFORMATICS
2008
172views more  BIOINFORMATICS 2008»
13 years 9 months ago
Fitting a geometric graph to a protein-protein interaction network
Motivation: Finding a good network null model for protein-protein interaction (PPI) networks is a fundamental issue. Such a model would provide insights into the interplay between...
Desmond J. Higham, Marija Rasajski, Natasa Przulj
STOC
1997
ACM
122views Algorithms» more  STOC 1997»
14 years 1 months ago
Fault-Tolerant Quantum Computation With Constant Error
Shor has showed how to perform fault tolerant quantum computation when the probability for an error in a qubit or a gate, η, decays with the size of the computation polylogarithmi...
Dorit Aharonov, Michael Ben-Or
INFOCOM
2007
IEEE
14 years 3 months ago
Mobility Reduces Uncertainty in MANETs
Abstract— Evaluating and quantifying trust stimulates collaboration in mobile ad hoc networks (MANETs). Many existing reputation systems sharply divide the trust value into right...
Feng Li, Jie Wu
ICDE
2002
IEEE
121views Database» more  ICDE 2002»
14 years 10 months ago
Similarity Flooding: A Versatile Graph Matching Algorithm and Its Application to Schema Matching
Matching elements of two data schemas or two data instances plays a key role in data warehousing, e-business, or even biochemical applications. In this paper we present a matching...
Sergey Melnik, Hector Garcia-Molina, Erhard Rahm
CCS
2007
ACM
14 years 3 months ago
Toward measuring network security using attack graphs
In measuring the overall security of a network, a crucial issue is to correctly compose the measure of individual components. Incorrect compositions may lead to misleading results...
Lingyu Wang, Anoop Singhal, Sushil Jajodia