895 search results - page 50 / 179 » Triangulating Topological Spaces |
95
Voted
IJCAI
2001
15 years 2 months ago
2001
Many state-of-the-art heuristic planners derive their heuristic function by relaxing the planning task at hand, where the relaxation is to assume that all delete lists are empty. ...
96
Voted
CORR
2006
Springer
15 years 22 days ago
2006
Springer
Coverage and connectivity issues of three-dimensional (3D) networks are addressed in [2], but that work assumes that a node can be placed at any arbitrary location. In this work, ...
109
Voted
UAI
1996
15 years 2 months ago
1996
In this paper we propose a family of algorithms combining treeclustering with conditioning that trade space for time. Such algorithms are useful for reasoning in probabilistic and...
121
Voted
WWW
2007
ACM
16 years 1 months ago
2007
ACM
Social networking services are a fast-growing business in the Internet. However, it is unknown if online relationships and their growth patterns are the same as in real-life socia...
84
Voted
SMI
2007
IEEE
15 years 7 months ago
2007
IEEE
In this paper, we introduce localized homology, a theory for finding local geometric descriptions for topological attributes. Given a space and a cover of subspaces, we construct...