3413 search results - page 419 / 683 » New Support Vector Algorithms |
158
click to vote
WADS
2001
Springer
15 years 8 months ago
2001
Springer
Even though a large number of I/O-efficient graph algorithms have been developed, a number of fundamental problems still remain open. For example, no space- and I/O-efficient algo...
138
click to vote
COLT
1999
Springer
15 years 8 months ago
1999
Springer
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...
139
click to vote
ICDCS
2002
IEEE
15 years 9 months ago
2002
IEEE
This paper presents in detail an efficient and provably correct algorithm for database replication over partitionable networks. Our algorithm avoids the need for end-toend acknow...
108
click to vote
DAWAK
2000
Springer
15 years 8 months ago
2000
Springer
In data mining, searching for frequent patterns is a common basic operation. It forms the basis of many interesting decision support processes. In this paper we present a new type ...
133
click to vote
CAISE
2006
Springer
15 years 7 months ago
2006
Springer
Answering performance to business queries, mainly of aggregated nature, known as On-Line Analytical Processing queries, depends heavily on the proper selection of multidimensional ...