90 search results - page 7 / 18 » Probabilistic Ranking Queries on Gaussians |
SCCC
1997
IEEE
13 years 11 months ago
1997
IEEE
A cooperative database allows the user to specify approximate or vague query conditions. A vague query requires the database system to rank the retrieved answers according to thei...
SIGMOD
2006
ACM
14 years 7 months ago
2006
ACM
There has been a great deal of interest in the past few years on ranking of results of queries on structured databases, including work on probabilistic information retrieval, rank...
CDC
2008
IEEE
13 years 7 months ago
2008
IEEE
Minimizing the rank of a matrix subject to constraints is a challenging problem that arises in many applications in control theory, machine learning, and discrete geometry. This c...
MP
2011
13 years 2 months ago
2011
Minimizing the rank of a matrix subject to constraints is a challenging problem that arises in many applications in machine learning, control theory, and discrete geometry. This c...
HIM
1997
Springer
13 years 11 months ago
1997
Springer
Classical retrieval models support content-oriented searching for documents using a set of words as data model. However, in hypertext and database applications we want to consider...