4198 search results - page 292 / 840 » In search of lost time |
155
click to vote
JMLR
2006
15 years 6 months ago
2006
We show how the concave-convex procedure can be applied to transductive SVMs, which traditionally require solving a combinatorial search problem. This provides for the first time ...
157
Voted
ICGA
2007
15 years 6 months ago
2007
In 1989, an effort to solve the game of checkers began. It was naïve because of the daunting size of the search space, 5×1020 positions, and because of computer capabilities of ...
226
click to vote
DASFAA
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract. Recently, we have proposed a novel method for the compression of time series based on mathematical models that explore dependencies between different time series. This r...
197
Voted
ICDAR
2003
IEEE
16 years 2 days ago
2003
IEEE
This paper proposes a method to accelerate character recognition of a large character set by employing pivots into the search space. We divide the feature space of character categ...
182
Voted
IJFCS
2006
15 years 6 months ago
2006
Abstract. We design a succinct full-text index based on the idea of Huffmancompressing the text and then applying the Burrows-Wheeler transform over it. The resulting structure can...