199 search results - page 23 / 40 » Model Kit for Lightweight Data Compression Algorithms |
119
click to vote
KDD
2007
ACM
16 years 1 days ago
2007
ACM
Characterising the differences between two databases is an often occurring problem in Data Mining. Detection of change over time is a prime example, comparing databases from two b...
76
Voted
ICNC
2009
Springer
15 years 6 months ago
2009
Springer
The main purpose of this paper is to propose an incorporating a grammatical evolution (GE) into the genetic algorithm (GA), called GEGA, and apply it to estimate the compressive s...
100
Voted
ICASSP
2011
IEEE
14 years 3 months ago
2011
IEEE
This paper links two a priori different topics, group testing and traitor tracing. Group testing, as an instantiation of a compressed sensing problem over binary data, is indeed e...
104
click to vote
KDD
2009
ACM
16 years 5 days ago
2009
ACM
All Netflix Prize algorithms proposed so far are prohibitively costly for large-scale production systems. In this paper, we describe an efficient dataflow implementation of a coll...
173
click to vote
SIGMOD
2009
ACM
15 years 12 months ago
2009
ACM
Service providers like Google and Amazon are moving into the SaaS (Software as a Service) business. They turn their huge infrastructure into a cloud-computing environment and aggr...