4940 search results - page 627 / 988 » On the Complexity of Universal Programs |
204
click to vote
HICSS
2010
IEEE
15 years 8 months ago
2010
IEEE
1 The latent semantic indexing (LSI) methodology for information retrieval applies the singular value decomposition to identify an eigensystem for a large matrix, in which cells re...
175
click to vote
CCS
2008
ACM
15 years 8 months ago
2008
ACM
In the Horn theory based approach for cryptographic protocol analysis, cryptographic protocols and (Dolev-Yao) intruders are modeled by Horn theories and security analysis boils d...
209
click to vote
DALT
2008
Springer
15 years 8 months ago
2008
Springer
ing and Verifying Strategy-proofness for Auction Mechanisms E. M. Tadjouddine, F. Guerin, and W. Vasconcelos Department of Computing Science, King's College, University of Abe...
252
click to vote
ECOOPW
2008
Springer
15 years 8 months ago
2008
Springer
Following last four years' RAM-SE (Reflection, AOP and Meta-Data for Software Evolution) workshop at the ECOOP conference, the RAM-SE'08 workshop was a successful and pop...
226
click to vote
NIPS
1994
15 years 8 months ago
1994
Deformable models are an attractive approach to recognizing nonrigid objects which have considerable within class variability. However, there are severe search problems associated...