28888 search results - page 127 / 5778 » Computability and complexity in analysis |
FOCS
1997
IEEE
14 years 9 days ago
1997
IEEE
We consider the problem of deciding whether a polygonal knot in 3dimensional Euclidean space is unknotted, capable of being continuously deformed without self-intersection so that...
WAIM
2010
Springer
13 years 6 months ago
2010
Springer
SimRank has been considered as one of the promising link-based ranking algorithms to evaluate similarities of web documents in many modern search engines. In this paper, we investi...
PODS
2004
ACM
14 years 8 months ago
2004
ACM
Computing frequent itemsets is one of the most prominent problems in data mining. We introduce a new, related problem, called FREQSAT: given some itemset-interval pairs, does ther...
JC
2008
13 years 8 months ago
2008
In this paper we analyze the problem of adaptivity for one-step numerical methods for solving ODEs, both IVPs and BVPs, with a view to generating grids of minimal computational co...
ICDM
2005
IEEE
14 years 1 months ago
2005
IEEE
It is estimated that ninety percent of the world’s species have yet to be discovered and described. The main reason for the slow pace of new species description is that the scie...