17760 search results - page 329 / 3552 » A Generalization of the Massey-Ding Algorithm |
201
Voted
TCC
2009
Springer
16 years 7 months ago
2009
Springer
Abstract. Goldreich (ECCC 2000) proposed a candidate one-way function construction which is parameterized by the choice of a small predicate (over d = O(1) variables) and of a bipa...
231
click to vote
AB
2007
Springer
16 years 1 months ago
2007
Springer
A series of papers, all under the title of Algorithmic Algebraic Model Checking (AAMC), has sought to combine techniques from algorithmic algebra, model checking and dynamical syst...
164
Voted
FCT
2005
Springer
16 years 10 days ago
2005
Springer
Graph homomorphism, also called H-coloring, is a natural generalization of graph coloring: There is a homomorphism from a graph G to a complete graph on k vertices if and only if ...
188
click to vote
NIPS
1998
15 years 8 months ago
1998
The Expectation Maximization EM algorithm is an iterative procedure for maximum likelihood parameter estimation from data sets with missing or hidden variables 2 . It has been app...
171
Voted
GIS
2008
ACM
15 years 8 months ago
2008
ACM
In a geographical route search, given search terms, the goal is to find an effective route that (1) starts at a given location, (2) ends at a given location, and (3) travels via...