2030 search results - page 198 / 406 » Extremal Problems of Information Combining |
160
click to vote
IDA
2002
Springer
15 years 6 months ago
2002
Springer
Recently we presented a new approach [20] to the classification problem arising in data mining. It is based on the regularization network approach but in contrast to other methods...
149
click to vote
STOC
2003
ACM
16 years 6 months ago
2003
ACM
Let H be a fixed directed graph on h vertices, let G be a directed graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. We show tha...
134
click to vote
IDA
2009
Springer
16 years 23 days ago
2009
Springer
One of the most important and challenging questions in the area of clustering is how to choose the best-fitting algorithm and parameterization to obtain an optiml clustering for t...
144
click to vote
WAIM
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Web caching plays an important role in many network services. Utilization of the cache in each level (server, proxy, and client) of network forms a web caching hierarchy....
162
click to vote
DAWAK
2001
Springer
15 years 10 months ago
2001
Springer
Adaptable similarity queries based on quadratic form distance functions are widely popular in data mining applications, particularly for domains such as multimedia, CAD, molecular ...