4843 search results - page 728 / 969 » The Shortcut Problem - Complexity and Approximation |
114
click to vote
ICDM
2009
IEEE
15 years 10 months ago
2009
IEEE
—In graph-based learning models, entities are often represented as vertices in an undirected graph with weighted edges describing the relationships between entities. In many real...
137
Voted
CANS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We consider generic Garbled Circuit (GC)-based techniques for Secure Function Evaluation (SFE) in the semi-honest model. We describe efficient GC constructions for additi...
139
click to vote
COCOON
2009
Springer
15 years 10 months ago
2009
Springer
The problems of uniformly sampling and approximately counting contingency tables have been widely studied, but efficient solutions are only known in special cases. One appealing ap...
130
Voted
ICFEM
2009
Springer
15 years 10 months ago
2009
Springer
Coinductive proofs of behavioral equivalence often require human ingenuity, in that one is expected to provide a “good” relation extending one’s goal with additional lemmas, ...
136
Voted
IDA
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We tackle the problem of new users or documents in collaborative filtering. Generalization over users by grouping them into user groups is beneficial when a rating is t...