2600 search results - page 233 / 520 » Clustering with or without the Approximation |
169
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
This paper studies the issue of space coordinate change in genetic algorithms, based on two methods: convex quadratic approximations, and principal component analysis. In both met...
197
click to vote
ANCS
2009
ACM
15 years 4 months ago
2009
ACM
Pattern matching is the most computation intensive task of a network intrusion detection system (NIDS). In this paper we present a hardware architecture to speed up the pattern mat...
147
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
This paper presents a novel method for reducing the dimensionality of kernel spaces. Recently, to maintain the convexity of training, loglinear models without mixtures have been u...
174
click to vote
ECCV
2002
Springer
16 years 8 months ago
2002
Springer
We present a completely automatic method for obtaining the approximate calibration of a camera (alignment to a world frame and focal length) from a single image of an unknown scene...
178
click to vote
DSN
2008
IEEE
16 years 1 months ago
2008
IEEE
Temporal locality in workloads creates conditions in which a server, in order to remain available, should quickly process bursts of requests with large service requirements. In th...