1361 search results - page 99 / 273 » Spaces of practice |
91
Voted
ISAAC
2005
Springer
15 years 6 months ago
2005
Springer
In this paper, we prove for the first time that the learning complexity of Rocchio’s algorithm is O(d+d2 (log d+log n)) over the discretized vector space {0, . . . , n − 1}d ,...
111
Voted
SPIRE
2005
Springer
15 years 6 months ago
2005
Springer
We consider the problem of finding pairs of short patterns such that, in a given input sequence of length n, the distance between each pair’s patterns is at least α. The proble...
102
click to vote
VDA
2010
15 years 3 months ago
2010
The analysis of high-dimensional data is an important, yet inherently difficult problem. Projection techniques such as PCA, MDS, and SOM can be used to map high-dimensional data t...
71
Voted
IJCAI
2007
15 years 2 months ago
2007
Classic direct mechanisms require full type (or utility) revelation from participating agents, something that can be very difficult in practical multi-attribute settings. In this...
87
Voted
SODA
2004
ACM
15 years 2 months ago
2004
ACM
The inference of evolutionary trees using approaches which attempt to solve the maximum parsimony (MP) and maximum likelihood (ML) optimization problems is a standard part of much...