15485 search results - page 350 / 3097 » Computing Optimal Subsets |
154
click to vote
ICASSP
2011
IEEE
14 years 11 months ago
2011
IEEE
All of the existing N-point discrete fractional signal transforms require O(N2 ) computation complexity. In this paper, we propose a new discrete fractional signal transform whose...
206
click to vote
ESA
2009
Springer
16 years 1 months ago
2009
Springer
A hash function h, i.e., a function from the set U of all keys to the range range [m] = {0, . . . , m − 1} is called a perfect hash function (PHF) for a subset S ⊆ U of size n ...
201
click to vote
ICDE
2007
IEEE
16 years 1 months ago
2007
IEEE
The ability to query data streams is of increasing importance and has been identified as a crucial element for modern organizations and agencies. This paper identifies a class o...
147
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
This study investigates automatic regular expression generation using Grammatical Evolution. The software implementation is based on a subset of POSIX regular expression rules. Fo...
198
click to vote
ICDM
2006
IEEE
16 years 1 months ago
2006
IEEE
In active learning, a machine learning algorithm is given an unlabeled set of examples U, and is allowed to request labels for a relatively small subset of U to use for training. ...