1991 search results - page 231 / 399 » Small Models of Large Machines |
191
click to vote
CPM
1998
Springer
15 years 8 months ago
1998
Springer
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
172
click to vote
FLAIRS
2000
15 years 6 months ago
2000
For manyknowledgeintensive applications, it is necessary to have extensive domain-specific knowledgein addition to general-purpose knowledge bases usually built around MachineRead...
140
Voted
JSA
2006
15 years 4 months ago
2006
It is often possible to greatly improve the performance of a hardware system via the use of predictive (speculative) techniques. For example, the performance of out-of-order micro...
137
click to vote
KAIS
2006
15 years 4 months ago
2006
Clustering has been one of the most widely studied topics in data mining and k-means clustering has been one of the popular clustering algorithms. K-means requires several passes ...
133
click to vote
ICASSP
2009
IEEE
15 years 11 months ago
2009
IEEE
We address covariance estimation under mean-squared loss in the Gaussian setting. Specifically, we consider shrinkage methods which are suitable for high dimensional problems wit...