1601 search results - page 207 / 321 » Closed Sets for Labeled Data |
165
click to vote
AAAI
2012
13 years 8 months ago
2012
Hashing, which tries to learn similarity-preserving binary codes for data representation, has been widely used for efficient nearest neighbor search in massive databases due to i...
132
click to vote
EDBT
2009
ACM
16 years 1 months ago
2009
ACM
Given a set Q of keywords, conventional keyword search (KS) returns a set of tuples, each of which (i) is obtained from a single relation, or by joining multiple relations, and (i...
156
click to vote
ISIPTA
2005
IEEE
16 years 6 hour ago
2005
IEEE
A Chaotic Probability model is a usual set of probability measures, M, the totality of which is endowed with an objective, frequentist interpretation as opposed to being viewed as...
153
click to vote
CIKM
2011
Springer
14 years 6 months ago
2011
Springer
Typically, users interact with database systems by formulating queries. However, many times users do not have a clear understanding of their information needs or the exact content...
229
click to vote
JMLR
2012
13 years 8 months ago
2012
Given a point set S and an unknown metric d on S, we study the problem of efficiently partitioning S into k clusters while querying few distances between the points. In our model...