Sciweavers

211 search results - page 4 / 43
» Restricting the IDM for Classification
Sort
View
IDMS
2000
Springer
128views Multimedia» more  IDMS 2000»
13 years 11 months ago
Fast and Optimal Multicast-Server Selection Based on Receivers' Preference
Abstract. In this paper, we propose static and dynamic server selection techniques for multicast receivers who receive multiple streams from replicated servers. In the proposed sta...
Akihito Hiromori, Hirozumi Yamaguchi, Keiichi Yasu...
FFA
2008
82views more  FFA 2008»
13 years 7 months ago
Asymptotic behavior of the number of solutions for non-Archimedean Diophantine approximations with restricted denominators
We consider metric results for the asymptotic behavior of the number of solutions of Diophantine approximation inequalities with restricted denominators for Laurent formal power s...
Valérie Berthé, Hitoshi Nakada, Rie ...
COMBINATORICS
2007
164views more  COMBINATORICS 2007»
13 years 7 months ago
Longest Alternating Subsequences in Pattern-Restricted Permutations
We determine the limiting distributions of the longest alternating subsequence for pattern-restricted permutations in which the pattern is any one of the six patterns of length th...
Ghassan Firro, Toufik Mansour, Mark C. Wilson
CC
2006
Springer
125views System Software» more  CC 2006»
13 years 7 months ago
A tight lower bound for restricted pir protocols
We show that any 1-round 2-server Private Information Retrieval Protocol where the answers are 1-bit long must ask questions that are at least n - 2 bits long, which is nearly equa...
Richard Beigel, Lance Fortnow, William I. Gasarch
COMBINATORICS
2000
114views more  COMBINATORICS 2000»
13 years 7 months ago
Restricted Permutations, Continued Fractions, and Chebyshev Polynomials
Let fr n(k) be the number of 132-avoiding permutations on n letters that contain exactly r occurrences of 12 . . . k, and let Fr(x; k) and F (x, y; k) be the generating functions d...
Toufik Mansour, Alek Vainshtein