5115 search results - page 453 / 1023 » On Randomized Lanczos Algorithms |
203
click to vote
IJCNLP
2005
Springer
16 years 1 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...
210
click to vote
PCI
2005
Springer
16 years 1 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...
219
click to vote
EVOW
2004
Springer
16 years 1 months ago
2004
Springer
This paper introduces a new social metaheuristic for the Max-Cut problem applied to a weighted undirected graph. This problem consists in finding a partition of the nodes into two ...
171
click to vote
ESA
2003
Springer
16 years 25 days ago
2003
Springer
We present a new finger search tree with O(1) worst-case update time and O(log log d) expected search time with high probability in the Random Access Machine (RAM) model of comput...
189
click to vote
ASIACRYPT
2001
Springer
16 years 4 days ago
2001
Springer
We study a class of problems called Modular Inverse Hidden Number Problems (MIHNPs). The basic problem in this class is the following: Given many pairs xi, msbk (α + xi)−1 mod p...