20441 search results - page 127 / 4089 » Locally Computable Structures |
IV
2007
IEEE
14 years 4 months ago
2007
IEEE
In this study, we crawled a local Web domain, created its graph representation, and analyzed the network structure. The results of network analysis revealed local scalefree patter...
AI
1999
Springer
13 years 10 months ago
1999
Springer
Yeap [42] argued that an important basis for computing a cognitive map is the ability to compute and recognise local environments. Although he has demonstrated how such local envi...
JSC
2006
13 years 10 months ago
2006
For a polynomial ring R = k[x1, ..., xn], we present a method to compute the characteristic cycle of the localization Rf for any nonzero polynomial f R that avoids a direct comput...
ICRA
2008
IEEE
14 years 4 months ago
2008
IEEE
— In this paper we present a polynomial Navigation Function (NF) for a sphere world that can be constructed almost locally, with partial knowledge of the environment. The present...
DMIN
2008
13 years 11 months ago
2008
We propose an approximate computation technique for inter-object distances for binary data sets. Our approach is based on the locality sensitive hashing, scales up with the number ...