Sciweavers

3708 search results - page 23 / 742
» Approximating Betweenness Centrality
Sort
View
SODA
2003
ACM
131views Algorithms» more  SODA 2003»
13 years 11 months ago
Zonotopes as bounding volumes
Zonotopes are centrally symmetric polytopes with a very special structure: they are the Minkowski sum of line segments. In this paper we propose to use zonotopes as bounding volum...
Leonidas J. Guibas, An Nguyen, Li Zhang
FOCS
2007
IEEE
14 years 4 months ago
Adaptive Simulated Annealing: A Near-optimal Connection between Sampling and Counting
We present a near-optimal reduction from approximately counting the cardinality of a discrete set to approximately sampling elements of the set. An important application of our wo...
Daniel Stefankovic, Santosh Vempala, Eric Vigoda
ISAAC
2001
Springer
125views Algorithms» more  ISAAC 2001»
14 years 2 months ago
Computing the Quartet Distance between Evolutionary Trees in Time O(n log2 n)
Evolutionary trees describing the relationship for a set of species are central in evolutionary biology, and quantifying differences between evolutionary trees is an important tas...
Gerth Stølting Brodal, Rolf Fagerberg, Chri...
GRAPHICSINTERFACE
2009
13 years 7 months ago
Structural differences between two graphs through hierarchies
This paper presents a technique for visualizing the differences between two graphs. The technique assumes that a unique labeling of the nodes for each graph is available, where if...
Daniel Archambault
ADBIS
2004
Springer
153views Database» more  ADBIS 2004»
14 years 3 months ago
Cooperative Transaction Processing between Clients and Servers
Business rules are often implemented as stored procedures in a database server. These procedures are triggered by various clients, but the execution load is fully centralized on th...
Steffen Jurk, Ulf Leser, José-Luis Marzo