5138 search results - page 631 / 1028 » Low-Entropy Set Selection. |
184
click to vote
SOFSEM
2010
Springer
16 years 3 months ago
2010
Springer
Regret minimization has proven to be a very powerful tool in both computational learning theory and online algorithms. Regret minimization algorithms can guarantee, for a single de...
203
click to vote
HIPEAC
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Iterative compilation is an efficient approach to optimize programs on rapidly evolving hardware, but it is still only scarcely used in practice due to a necessity to gat...
168
click to vote
CICLING
2007
Springer
16 years 29 days ago
2007
Springer
The present paper describes how dependency analysis can be used to automatically extract from a corpus a set of cases - and an accompanying vocabulary - which enable a template-bas...
152
click to vote
MLG
2007
Springer
16 years 28 days ago
2007
Springer
1 In web-related applications of image categorization, it is desirable to derive an interpretable classification rule with high accuracy. Using the bag-of-words representation and...
155
click to vote
AH
2004
Springer
16 years 6 days ago
2004
Springer
Current search engines rely on centralized page ranking algorithms which compute page rank values as single (global) values for each Web page. Recent work on topic-sensitive PageRa...