4377 search results - page 578 / 876 » Mass problems and randomness |
199
click to vote
ALT
1997
Springer
15 years 11 months ago
1997
Springer
Efficient learning of DFA is a challenging research problem in grammatical inference. It is known that both exact and approximate (in the PAC sense) identifiability of DFA is har...
187
click to vote
EPIA
1997
Springer
15 years 11 months ago
1997
Springer
GenSATis a family of local hill-climbing procedures for solving propositional satisfiability problems.We restate it as a navigational search process performed on an N-dimensionalc...
150
click to vote
ACISP
2007
Springer
15 years 10 months ago
2007
Springer
Compact e-cash schemes allow a user to withdraw a wallet containing k coins in a single operation, each of which the user can spend unlinkably. One big open problem for compact e-c...
204
click to vote
COCOA
2009
Springer
15 years 10 months ago
2009
Springer
Online social network has developed significantly in recent years as a medium of communicating, sharing and disseminating information and spreading influence. Most of current resea...
159
click to vote
ADMA
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Most of the work in Machine Learning assume that examples are generated at random according to some stationary probability distribution. In this work we study the problem...