14165 search results - page 485 / 2833 » The generalized two-server problem |
165
click to vote
ASIACRYPT
2004
Springer
16 years 10 days ago
2004
Springer
We introduce a new computational problem related to the interpolation of group homomorphisms which generalizes many famous cryptographic problems including discrete logarithm, Diļ¬...
175
click to vote
SPAA
2003
ACM
16 years 5 days ago
2003
ACM
The general problem of verifying coherence for shared-memory multiprocessor executions is NP-Complete. Verifying memory consistency models is therefore NP-Hard, because memory con...
173
click to vote
FCT
2003
Springer
16 years 4 days ago
2003
Springer
Abstract. Given a subset S of N, ļ¬ltering a word a0a1 Ā· Ā· Ā· an by S consists in deleting the letters ai such that i is not in S. By a natural generalization, denote by L[S], w...
211
click to vote
FOCS
2002
IEEE
15 years 12 months ago
2002
IEEE
We show that Graph Isomorphism is in the complexity class SPP, and hence it is in āP (in fact, it is in ModkP for each k ā„ 2). We derive this result as a corollary of a more g...
160
click to vote
ICANN
2001
Springer
15 years 11 months ago
2001
Springer
Sparse kernel regressors have become popular by applying the support vector method to regression problems. Although this approach has been shown to exhibit excellent generalization...