Sciweavers

1248 search results - page 124 / 250
» On the Number of Birch Partitions
Sort
View
WAOA
2005
Springer
161views Algorithms» more  WAOA 2005»
14 years 3 months ago
"Almost Stable" Matchings in the Roommates Problem
An instance of the classical Stable Roommates problem (sr) need not admit a stable matching. This motivates the problem of finding a matching that is “as stable as possible”, ...
David J. Abraham, Péter Biró, David ...
VLDB
1989
ACM
140views Database» more  VLDB 1989»
14 years 2 months ago
The Effect of Bucket Size Tuning in the Dynamic Hybrid GRACE Hash Join Method
In this paper, we show detailed analysis and performance evaluation of the Dynamic Hybrid GRACE Hash Join Method (DHGH Method) when the tuple distribution in buckets is unbalanced...
Masaru Kitsuregawa, Masaya Nakayama, Mikio Takagi
WOB
2003
140views Bioinformatics» more  WOB 2003»
13 years 11 months ago
Computing Maximum Subsequence in Parallel
The maximum subsequence problem finds the contiguous subsequence of n real numbers with the highest sum. This is an important problem that arises in several contexts in Computatio...
Carlos E. R. Alves, Edson Cáceres, Siang W....
CORR
2008
Springer
110views Education» more  CORR 2008»
13 years 10 months ago
Trimmed Moebius Inversion and Graphs of Bounded Degree
We study ways to expedite Yates's algorithm for computing the zeta and Moebius transforms of a function defined on the subset lattice. We develop a trimmed variant of Moebius ...
Andreas Björklund, Thore Husfeldt, Petteri Ka...
SIAMDM
2010
133views more  SIAMDM 2010»
13 years 8 months ago
Drop Cost and Wavelength Optimal Two-Period Grooming with Ratio 4
We study grooming for two-period optical networks, a variation of the traffic grooming problem for WDM ring networks introduced by Colbourn, Quattrocchi, and Syrotiuk. In the two-...
Jean-Claude Bermond, Charles J. Colbourn, Lucia Gi...