3941 search results - page 209 / 789 » Computational Efficiency of Batching Methods |
175
click to vote
DAGM
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. In this paper, we present a novel method for reducing the computational complexity of a Support Vector Machine (SVM) classifier without significant loss of accuracy. We a...
121
Voted
ESA
2000
Springer
15 years 7 months ago
2000
Springer
Several algorithms for computing the Minkowski sum of two polygons in the plane begin by decomposing each polygon into convex subpolygons. We examine different methods for decompo...
153
Voted
ACSAC
1997
IEEE
15 years 7 months ago
1997
IEEE
We study methods for reducing the cost of secure link state routing. In secure link state routing, routers may need to verify the authenticity of many routing updates, and some ro...
133
click to vote
EMNLP
2010
15 years 2 months ago
2010
This paper proposes a fast and simple unsupervised word segmentation algorithm that utilizes the local predictability of adjacent character sequences, while searching for a leaste...
113
click to vote
IDA
2009
Springer
15 years 1 months ago
2009
Springer
Abstract. The effective construction of many association rule bases requires the computation of both frequent closed and frequent generator itemsets (FCIs/FGs). However, only few m...