2588 search results - page 358 / 518 » Applications of Kolmogorov complexity to computable model th... |
132
click to vote
JACM
2010
15 years 11 days ago
2010
Description logics (DLs) and rules are formalisms that emphasize different aspects of knowledge representation: whereas DLs are focused on specifying and reasoning about conceptual...
119
click to vote
ACSC
2008
IEEE
15 years 8 months ago
2008
IEEE
We propose a more efficient privacy preserving set intersection protocol which improves the previously known result by a factor of O(N) in both the computation and communication c...
121
click to vote
SIGECOM
2004
ACM
15 years 7 months ago
2004
ACM
In many market settings, agents do not know their preferences a priori. Instead, they may have to solve computationally complex optimization problems, query databases, or perform ...
ATAL
2008
Springer
15 years 3 months ago
2008
Springer
We study the concept of bribery in the situation where voters are willing to change their votes as we ask them, but where their prices depend on the nature of the change we reques...
119
Voted
ICML
2010
IEEE
15 years 3 months ago
2010
IEEE
We propose a novel boosting algorithm which improves on current algorithms for weighted voting classification by striking a better balance between classification accuracy and the ...