Sciweavers

334 search results - page 57 / 67
» On Shift-Invariant Sparse Coding
Sort
View
ICDM
2007
IEEE
99views Data Mining» more  ICDM 2007»
14 years 3 months ago
Optimizing Frequency Queries for Data Mining Applications
Data mining algorithms use various Trie and bitmap-based representations to optimize the support (i.e., frequency) counting performance. In this paper, we compare the memory requi...
Hassan H. Malik, John R. Kender
EVOW
2007
Springer
14 years 3 months ago
Overcompressing JPEG Images with Evolution Algorithms
Abstract. Overcompression is the process of post-processing compressed images to gain either further size reduction or improved quality. This is made possible by the fact that the ...
Jacques Lévy Véhel, Franklin Mendivi...
IPPS
2005
IEEE
14 years 2 months ago
Automatic Support for Irregular Computations in a High-Level Language
The problem of writing high performance parallel applications becomes even more challenging when irregular, sparse or adaptive methods are employed. In this paper we introduce com...
Jimmy Su, Katherine A. Yelick
BMCBI
2008
171views more  BMCBI 2008»
13 years 9 months ago
A general approach to simultaneous model fitting and variable elimination in response models for biological data with many more
Background: With the advent of high throughput biotechnology data acquisition platforms such as micro arrays, SNP chips and mass spectrometers, data sets with many more variables ...
Harri T. Kiiveri
JSAC
2011
185views more  JSAC 2011»
13 years 4 months ago
Joint Dynamic Resource Allocation and Waveform Adaptation for Cognitive Networks
This paper investigates the issue of dynamic resource allocation (DRA) in the context of multiuser cognitive radio networks. We present a general framework adopting generalized si...
Zhi Tian, Geert Leus, Vincenzo Lottici