3395 search results - page 208 / 679 » Learning to efficiently rank |
261
click to vote
ICDE
2009
IEEE
16 years 5 months ago
2009
IEEE
A common approach to performing keyword search over relational databases is to find the minimum Steiner trees in database graphs. These methods, however, are rather expensive as th...
260
Voted
ICDE
2002
IEEE
16 years 5 months ago
2002
IEEE
With the growth of the Web, there has been a rapid increase in the number of users who need to access online databases without having a detailed knowledge of the schema or of quer...
111
click to vote
KDD
2006
ACM
16 years 4 months ago
2006
ACM
Ordering and ranking items of different types are important tasks in various applications, such as query processing and scientific data mining. A total order for the items can be ...
129
click to vote
ICPR
2008
IEEE
15 years 10 months ago
2008
IEEE
Nonnegative matrix factorization (NMF) has been shown to be an efficient clustering tool. However, NMF`s batch nature necessitates recomputation of whole basis set for new samples...
156
Voted
EDBT
2010
ACM
15 years 7 months ago
2010
ACM
Recently, there has been growing interest in random sampling from online hidden databases. These databases reside behind form-like web interfaces which allow users to execute sear...