5316 search results - page 133 / 1064 » Which Search Problems Are Random |
98
Voted
COLT
2008
Springer
15 years 5 months ago
2008
Springer
This paper describes an efficient reduction of the learning problem of ranking to binary classification. The reduction guarantees an average pairwise misranking regret of at most t...
129
Voted
ICASSP
2010
IEEE
15 years 3 months ago
2010
IEEE
This paper addresses the problem of developing appropriate features for use in direct modeling approaches to speech recognition, such as those based on Maximum Entropy models or S...
127
Voted
TCC
2007
Springer
15 years 9 months ago
2007
Springer
Private approximation of search problems deals with finding approximate solutions to search problems while disclosing as little information as possible. The focus of this work is ...
138
Voted
PAMI
2006
15 years 3 months ago
2006
A visual search is required when applying a recognition process on a scene containing multiple objects. In such cases, we would like to avoid an exhaustive sequential search. This...
141
Voted
IJCAI
2003
15 years 4 months ago
2003
In this paper we consider the solution of scheduling problems that are inherently over-subscribed. In such problems, there are always more tasks to execute within a given time fra...