19 search results - page 3 / 4 » Learning via Finitely Many Queries |
CONCUR
2006
Springer
14 years 11 months ago
2006
Springer
In regular inference, the problem is to infer a regular language, typically represented by a deterministic finite automaton (DFA) from answers to a finite set of membership querie...
SIGECOM
2003
ACM
15 years 2 months ago
2003
ACM
Preference elicitation — the process of asking queries to determine parties’ preferences — is a key part of many problems in electronic commerce. For example, a shopping age...
ICCV
2007
IEEE
15 years 3 months ago
2007
IEEE
Given a query image of an object, our objective is to retrieve all instances of that object in a large (1M+) image database. We adopt the bag-of-visual-words architecture which ha...
101
click to vote
WSDM
2010
ACM
15 years 7 months ago
2010
ACM
Although Web search engines are targeted towards helping people find new information, people regularly use them to re-find Web pages they have seen before. Researchers have noted ...
ICML
2010
IEEE
14 years 10 months ago
2010
IEEE
We present a theoretical analysis of supervised ranking, providing necessary and sufficient conditions for the asymptotic consistency of algorithms based on minimizing a surrogate...