Sciweavers

3708 search results - page 56 / 742
» Approximating Betweenness Centrality
Sort
View
ICDE
2008
IEEE
163views Database» more  ICDE 2008»
15 years 11 days ago
Approximate Joins for Data-Centric XML
In data integration applications, a join matches elements that are common to two data sources. Often, however, elements are represented slightly different in each source, so an app...
Nikolaus Augsten, Michael H. Böhlen, Curtis E...
AUTOMATICA
2007
179views more  AUTOMATICA 2007»
13 years 11 months ago
Approximate bisimulation relations for constrained linear systems
In this paper, we define the notion of approximate bisimulation relation between two continuous systems. While exact bisimulation requires that the observations of two systems ar...
Antoine Girard, George J. Pappas
SIAMCOMP
2000
125views more  SIAMCOMP 2000»
13 years 10 months ago
Approximating the Stretch Factor of Euclidean Graphs
There are several results available in the literature dealing with efficient construction of t-spanners for a given set S of n points in Rd. t-spanners are Euclidean graphs in whic...
Giri Narasimhan, Michiel H. M. Smid
APPROX
2006
Springer
120views Algorithms» more  APPROX 2006»
14 years 2 months ago
Approximating Average Parameters of Graphs
Inspired by Feige (36th STOC, 2004), we initiate a study of sublinear randomized algorithms for approximating average parameters of a graph. Specifically, we consider the average ...
Oded Goldreich, Dana Ron
ALGORITHMICA
2005
110views more  ALGORITHMICA 2005»
13 years 11 months ago
Geographic Quorum System Approximations
Quorum systems are a mechanism for obtaining fault-tolerance and efficient distributed systems. We consider geographic quorum systems; a geographic quorum system is a partition of...
Paz Carmi, Shlomi Dolev, Sariel Har-Peled, Matthew...