5138 search results - page 476 / 1028 » Randomized Algorithms for 3-SAT |
200
click to vote
EUROCRYPT
2005
Springer
16 years 13 days 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...
181
click to vote
IJCNLP
2005
Springer
16 years 12 days 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...
184
click to vote
PCI
2005
Springer
16 years 12 days 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...
192
click to vote
EVOW
2004
Springer
16 years 9 days 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 ...
150
click to vote
ESA
2003
Springer
16 years 4 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...