Sciweavers

3731 search results - page 600 / 747
» cases 2006
Sort
View
ALGORITHMICA
2006
94views more  ALGORITHMICA 2006»
15 years 25 days ago
Efficient Algorithms for k Maximum Sums
We study the problem of computing the k maximum sum subsequences. Given a sequence of real numbers x1, x2, . . . , xn and an integer parameter k, 1 k 1 2 n(n - 1), the problem in...
Fredrik Bengtsson, Jingsen Chen
ALGORITHMICA
2006
174views more  ALGORITHMICA 2006»
15 years 25 days ago
Profiles of Random Trees: Limit Theorems for Random Recursive Trees and Binary Search Trees
We prove convergence in distribution for the profile (the number of nodes at each level), normalized by its mean, of random recursive trees when the limit ratio of the level and ...
Michael Fuchs, Hsien-Kuei Hwang, Ralph Neininger
ALGORITHMICA
2006
160views more  ALGORITHMICA 2006»
15 years 25 days ago
Combinatorial Algorithms for the Unsplittable Flow Problem
We provide combinatorial algorithms for the unsplittable flow problem (UFP) that either match or improve the previously best results. In the UFP we are given a (possibly directed)...
Yossi Azar, Oded Regev
98
Voted
AMAI
2006
Springer
15 years 25 days ago
A split-combination approach to merging knowledge bases in possibilistic logic
In this paper, we propose an adaptive approach to merging possibilistic knowledge bases that deploys multiple operators instead of a single operator in the merging process. The me...
Guilin Qi, Weiru Liu, David H. Glass, David A. Bel...
103
Voted
APAL
2006
94views more  APAL 2006»
15 years 25 days ago
Classifiable theories without finitary invariants
: It follows directly from Shelah's structure theory that if T is a classifiable theory, then the isomorphism type of any model of T is determined by the theory of that model ...
Elisabeth Bouscaren, Ehud Hrushovski