587 search results - page 89 / 118 » Theory of matching pursuit |
FSE
2005
Springer
14 years 2 months ago
2005
Springer
A T-function is a mapping from n-bit words to n-bit words in which for each 0 ≤ i < n, bit i of any output word can depend only on bits 0, 1, . . . , i of any input word. All ...
ICAPR
2005
Springer
14 years 1 months ago
2005
Springer
There is need for more formal specification of recognition tasks. Currently, it is common to use labeled training samples to illustrate the task to be performed. The mathematical ...
KDD
2004
ACM
14 years 1 months ago
2004
ACM
We present a graph-theoretic approach to discover storylines from search results. Storylines are windows that offer glimpses into interesting themes latent among the top search re...
PPSN
2004
Springer
14 years 1 months ago
2004
Springer
It is typical for the EA community that theory follows experiments. Most theoretical approaches use some model of the considered evolutionary algorithm (EA) but there is also some ...
INFOCOM
2003
IEEE
14 years 1 months ago
2003
IEEE
—This paper is aimed at designing a congestion control system that scales gracefully with network capacity, providing high utilization, low queueing delay, dynamic stability, and...