1716 search results - page 61 / 344 » Proving Conditional Termination |
ICMCS
2005
IEEE
14 years 2 months ago
2005
IEEE
Kernel based methods such as Support Vector Machine (SVM) have provided successful tools for solving many recognition problems. One of the reason of this success is the use of ker...
IJCV
1998
13 years 8 months ago
1998
The appearance of an object depends on both the viewpoint from which it is observed and the light sources by which it is illuminated. If the appearance of two objects is never iden...
TCS
2010
13 years 7 months ago
2010
— Rahman and Kaykobad introduced a shortest distance based condition for finding the existence of Hamiltonian paths in graphs as follows: Let G be a connected graph with n vertic...
NETWORKS
2002
13 years 8 months ago
2002
The conditional diameter D of a digraph G measures how far apart a pair of vertex sets V1 and V2 can be in such a way that the minimum out-degree and the minimum in-degree of the ...
STOC
2009
ACM
14 years 9 months ago
2009
ACM
In this paper we study a fundamental open problem in the area of probabilistic checkable proofs: What is the smallest s such that NP naPCP1,s[O(log n), 3]? In the language of har...