397 search results - page 67 / 80 » Pseudorandom Functions and Lattices |
110
click to vote
TACAS
2009
Springer
15 years 8 months ago
2009
Springer
CEDAR (Counter Example Driven Antichain Refinement) is a new symbolic algorithm for computing weakest strategies for safety games of imperfect information. The algorithm computes ...
119
click to vote
ICASSP
2008
IEEE
15 years 7 months ago
2008
IEEE
In this paper we investigate a discriminative approach to feature weighting for topic identification using minimum classification error (MCE) training. Our approach learns featu...
117
click to vote
EMMCVPR
2003
Springer
15 years 6 months ago
2003
Springer
In this paper, a novel general purpose clustering algorithm is presented, based on the watershed algorithm. The proposed approach defines a density function on a suitable lattice,...
122
click to vote
FCT
1999
Springer
15 years 5 months ago
1999
Springer
Kleene’s theorem on recognizable languages in free monoids is considered to be of eminent importance in theoretical computer science. It has been generalized into various directi...
133
click to vote
CAV
2006
Springer
15 years 5 months ago
2006
Springer
We propose and evaluate a new algorithm for checking the universality of nondeterministic finite automata. In contrast to the standard algorithm, which uses the subset construction...