16666 search results - page 106 / 3334 » Descriptive and Computational Complexity |
109
click to vote
FOCS
1997
IEEE
15 years 8 months 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...
129
click to vote
WAIM
2010
Springer
15 years 1 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...
125
click to vote
PODS
2004
ACM
16 years 4 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...
141
click to vote
JC
2008
15 years 3 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...
126
click to vote
ICSE
2007
IEEE-ACM
16 years 4 months ago
2007
IEEE-ACM
Many architecture description languages (ADLs) have been proposed to model, analyze, configure, and deploy complex software systems. To face this diversity, extensible ADLs (or AD...