436 search results - page 53 / 88 » A Note on Negligible Functions |
EUROCRYPT
2004
Springer
15 years 3 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)...
DC
2007
14 years 9 months ago
2007
Suppose that some parties are connected by an incomplete network of reliable and private channels. The parties cooperate to execute some protocol. However, the parties are curious...
CORR
2000
Springer
14 years 9 months ago
2000
Springer
For logic programs with arithmetic predicates, showing termination is not easy, since the usual order for the integers is not well-founded. A new method, easily incorporated in th...
CVPR
2007
IEEE
15 years 11 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...
185
click to vote
ICDE
2006
IEEE
15 years 11 months ago
2006
IEEE
This paper proposes and solves the Time-Interval All Fastest Path (allFP) query. Given a user-defined leaving or arrival time interval I, a source node s and an end node e, allFP ...