337 search results - page 44 / 68 » Efficient algorithms for ranking with SVMs |
154
click to vote
FORTE
2004
15 years 7 months ago
2004
Abstract. We present automated techniques for the explanation of counterexamples, where a counter-example should be understood as a sequence of program statements. Our approach is ...
170
click to vote
PVLDB
2008
15 years 5 months ago
2008
Unlike traditional database queries, keyword queries do not adhere to predefined syntax and are often dirty with irrelevant words from natural languages. This makes accurate and e...
294
click to vote
ICDE
2002
IEEE
16 years 7 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...
176
click to vote
CP
2005
Springer
15 years 11 months ago
2005
Springer
In this paper we show how Constraint Programming (CP) techniques can improve the efficiency and applicability of grid-based algorithms for optimising surface contact between comple...
176
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
This work presents GROUSE (Grassmanian Rank-One Update Subspace Estimation), an efficient online algorithm for tracking subspaces from highly incomplete observations. GROUSE requi...