5153 search results - page 460 / 1031 » Introduction to Randomized Algorithms |
165
click to vote
MCAM
2007
Springer
16 years 14 days ago
2007
Springer
In this paper, we present an optimized topology maintenance framework used in AVStreamer P2P media streaming system. To help new incoming clients get an initial view of the whole n...
147
click to vote
INFOCOM
2006
IEEE
16 years 10 days ago
2006
IEEE
— We consider feed-forward packet switched networks with fixed routing and random congestion losses. Users of the network are assumed to be greedy in the sense that each user in...
188
Voted
EUROCRYPT
2005
Springer
15 years 12 months ago
2005
Springer
We prove, under the strong RSA assumption, that the group of invertible integers modulo the product of two safe primes is pseudo-free. More specifically, no polynomial time algor...
163
click to vote
IJCNLP
2005
Springer
15 years 12 months ago
2005
Springer
The current work applies Conditional Random Fields to the problem of temporal reference mapping from Chinese text to English text. The learning algorithm utilizes a moderate number...
173
click to vote
PCI
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. In this paper, we propose a novel heuristic algorithm for constructing a minimum cost multicast tree. Our work is based on a directed asymmetric network and shows an impr...