5595 search results - page 1045 / 1119 » Approximation Algorithms for Clustering Problems |
139
click to vote
FSE
2008
Springer
15 years 6 months ago
2008
Springer
At Crypto 2007, Joux and Peyrin showed that the boomerang attack, a classical tool in block cipher cryptanalysis, can also be very useful when analyzing hash functions. They applie...
144
click to vote
AAAI
2010
15 years 6 months ago
2010
Partially-observable Markov decision processes (POMDPs) provide a powerful model for sequential decision-making problems with partially-observed state and are known to have (appro...
146
click to vote
AAAI
2010
15 years 6 months ago
2010
In this paper, we study cost-sensitive semi-supervised learning where many of the training examples are unlabeled and different misclassification errors are associated with unequa...
114
click to vote
IJCAI
2007
15 years 6 months ago
2007
Classic direct mechanisms require full type (or utility) revelation from participating agents, something that can be very difficult in practical multi-attribute settings. In this...
152
click to vote
IJCAI
2003
15 years 6 months ago
2003
The problem of identifying approximately duplicate objects in databases is an essential step for the information integration process. Most existing approaches have relied on gener...