26354 search results - page 220 / 5271 » How we refactor, and how we know it |
169
click to vote
ECML
2003
Springer
15 years 12 months ago
2003
Springer
In traditional multi-instance (MI) learning, a single positive instance in a bag produces a positive class label. Hence, the learner knows how the bag’s class label depends on th...
167
click to vote
EUROCRYPT
2006
Springer
15 years 10 months ago
2006
Springer
Non-interactive zero-knowledge (NIZK) proof systems are fundamental cryptographic primitives used in many constructions, including CCA2-secure cryptosystems, digital signatures, an...
187
click to vote
DBSEC
2000
15 years 8 months ago
2000
Privacy refers to controlling the dissemination and use of personal data, including information that is knowingly disclosed, as well as data that are unintentionally revealed as a ...
158
click to vote
CN
2004
15 years 6 months ago
2004
This paper studies distributed choice of retransmission probabilities in slotted ALOHA. Both the cooperative team problem as well as the noncooperative game problem are considered...
185
click to vote
LPAR
2010
Springer
15 years 4 months ago
2010
Springer
By Courcelle's Theorem we know that any property of finite structures definable in monadic second-order logic (MSO) becomes tractable over structures with bounded treewidth. T...