1969 search results - page 206 / 394 » Financial Theory 1 |
157
click to vote
AMAST
2006
Springer
15 years 10 months ago
2006
Springer
We propose two characterizations of complexity classes by means of programming languages. The first concerns Logspace while the second leads to Ptime. This latter characterization ...
158
click to vote
COLT
2006
Springer
15 years 10 months ago
2006
Springer
We study the average number of well-chosen labeled examples that are required for a helpful teacher to uniquely specify a target function within a concept class. This "average...
178
click to vote
SP
1997
IEEE
15 years 10 months ago
1997
IEEE
Encrypted Key Exchange (EKE) [1, 2] allows two parties sharing a password to exchange authenticated information over an insecure network by using a combination of public and secre...
170
click to vote
CSC
2008
15 years 8 months ago
2008
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...
173
click to vote
CIKM
2008
Springer
15 years 7 months ago
2008
Springer
This paper aims to quantify two common assumptions about social tagging: (1) that tags are “meaningful” and (2) that the tagging process is influenced by tag suggestions. For...