Sciweavers

301 search results - page 49 / 61
» The k-Median Problem for Directed Trees
Sort
View
ISAAC
1998
Springer
66views Algorithms» more  ISAAC 1998»
13 years 11 months ago
A Parallel Algorithm for Sampling Matchings from an Almost Uniform Distribution
In this paper we present a randomized parallel algorithm to sample matchings from an almost uniform distribution on the set of matchings of all sizes in a graph. First we prove th...
Josep Díaz, Jordi Petit, Panagiotis Psychar...
CPM
2006
Springer
182views Combinatorics» more  CPM 2006»
13 years 11 months ago
Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE
The Range-Minimum-Query-Problem is to preprocess an array such that the position of the minimum element between two specified indices can be obtained efficiently. We present a dire...
Johannes Fischer, Volker Heun
CORR
2010
Springer
180views Education» more  CORR 2010»
13 years 7 months ago
A Network Coding Approach to Loss Tomography
Network tomography aims at inferring internal network characteristics based on measurements at the edge of the network. In loss tomography, in particular, the characteristic of in...
Athina Markopoulou, Christina Fragouli, Minas Gjok...
TEC
2002
119views more  TEC 2002»
13 years 7 months ago
Graph-based evolutionary design of arithmetic circuits
Abstract--In this paper, we present an efficient graph-based evolutionary optimization technique called evolutionary graph generation (EGG) and the proposed approach is applied to ...
Dingjun Chen, Takafumi Aoki, Naofumi Homma, Toshik...
HPDC
2000
IEEE
13 years 12 months ago
Performance Evaluation of a Firewall-Compliant Globus-based Wide-Area Cluster System
In this paper, we present a performance evaluation of a wide-area cluster system based on a rewallenabled Globus metacomputing toolkit. In order to establish communication links ...
Yoshio Tanaka, Motonori Hirano, Mitsuhisa Sato, Hi...