10146 search results - page 435 / 2030 » Fast FAST |
201
Voted
CAV
2003
Springer
16 years 9 days ago
2003
Springer
We show that the model checking problem for µ-calculus on graphs of bounded tree-width can be solved in time linear in the size of the system. The result is presented by first sh...
131
click to vote
CCS
2003
ACM
16 years 9 days ago
2003
ACM
Ò ÙØÓÑ Ø × ÙÖ ØÝ ÔÖÓØÓ ÓÐ Ò Ö ØÓÖ × ÔÖÓÔÓ× Ø Ø Ù× × ÐÓ ¹ × ×ÝÒØ × × ÖÙÐ × ØÓ Ù Ø Ò Û Ö × Ö ÓÖ ×Ù Ø Ð ÔÖÓØÓ Ó...
247
click to vote
ECCV
2010
Springer
16 years 9 days ago
2010
Springer
Approximate Nearest Neighbor (ANN) methods such as Locality Sensitive Hashing, Semantic Hashing, and Spectral Hashing, provide computationally ecient procedures for nding objects...