89 search results - page 18 / 18 » Constructing Reeb graphs using cylinder maps |
COMPGEOM
2006
ACM
13 years 10 months ago
2006
ACM
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...
VLDB
2000
ACM
13 years 9 months ago
2000
ACM
Keyword indices, topic directories, and link-based rankings are used to search and structure the rapidly growing Web today. Surprisingly little use is made of years of browsing ex...
ICLP
1997
Springer
13 years 10 months ago
1997
Springer
Abstract This paper describes a general framework for automatic termination analysis of logic programs, where we understand by termination" the niteness of the LD-tree constru...
CCA
2009
Springer
13 years 10 months ago
2009
Springer
Abstract. In this paper we study a new approach to classify mathematical theorems according to their computational content. Basically, we are asking the question which theorems can...