113 search results - page 22 / 23 » Fast algorithms for discrete polynomial transforms |
ASPDAC
2008
ACM
13 years 9 months ago
2008
ACM
Nowadays a placement problem often involves multi-million objects and excessive fixed blockages. We present a new global placement algorithm that scales well to the modern large-s...
DM
2006
13 years 7 months ago
2006
A computer package is being developed at Bayreuth for the generation and investigation of discrete structures. The package is a C and C++ class library of powerful algorithms endow...
ICCV
2011
IEEE
12 years 7 months ago
2011
IEEE
Rank correlation measures are known for their resilience to perturbations in numeric values and are widely used in many evaluation metrics. Such ordinal measures have rarely been ...
SODA
2010
ACM
14 years 4 months ago
2010
ACM
We consider the following "efficiently decodable" nonadaptive group testing problem. There is an unknown string x {0, 1}n with at most d ones in it. We are allowed to t...
DATAMINE
2007
13 years 7 months ago
2007
Many high level representations of time series have been proposed for data mining, including Fourier transforms, wavelets, eigenwaves, piecewise polynomial models etc. Many researc...