575 search results - page 70 / 115 » A Note on Karr's Algorithm |
103
click to vote
EUROCRYPT
2004
Springer
15 years 4 months ago
2004
Springer
Informally, an obfuscator O is an efficient, probabilistic “compiler” that transforms a program P into a new program O(P) with the same functionality as P, but such that O(P)...
111
click to vote
FOCS
1995
IEEE
15 years 2 months ago
1995
IEEE
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...
92
Voted
SIAMCOMP
1998
14 years 10 months ago
1998
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on p...
109
click to vote
TCS
2010
14 years 9 months ago
2010
: We study a variant of the path cover problem, namely, the k-fixed-endpoint path cover problem, or kPC for short. Given a graph G and a subset T of k vertices of V (G), a k-fixe...
CVPR
2007
IEEE
16 years 1 months ago
2007
IEEE
In this paper, we investigate linear discriminant analysis (LDA) methods for multiclass classification problems in hyperspectral imaging. We note that LDA does not consider pairwi...