Sciweavers

612 search results - page 2 / 123
» Using Data Compressors to Construct Rank Tests
Sort
View
SDM
2007
SIAM
169views Data Mining» more  SDM 2007»
14 years 11 months ago
Rank Aggregation for Similar Items
The problem of combining the ranked preferences of many experts is an old and surprisingly deep problem that has gained renewed importance in many machine learning, data mining, a...
D. Sculley
SPE
2008
108views more  SPE 2008»
14 years 10 months ago
Effective asymmetric XML compression
The innate verbosity of the Extensible Markup Language remains one of its main weaknesses, especially when large XML documents are concerned. This problem can be solved with the a...
Przemyslaw Skibinski, Szymon Grabowski, Jakub Swac...
NCA
2002
IEEE
14 years 9 months ago
The Construction of Smooth Models using Irregular Embeddings Determined by a Gamma Test Analysis
One of the key problems in forming a smooth model from input-output data is the determination of which input variables are relevant in predicting a given output. In this paper we ...
Alban P. M. Tsui, Antonia J. Jones, A. Guedes de O...
MOBISYS
2003
ACM
15 years 9 months ago
Energy Aware Lossless Data Compression
Wireless transmission of a bit can require over 1000 times more energy than a single 32-bit computation. It would therefore seem desirable to perform significant computation to re...
Kenneth C. Barr, Krste Asanovic
JBI
2008
159views Bioinformatics» more  JBI 2008»
14 years 10 months ago
SEGS: Search for enriched gene sets in microarray data
Gene Ontology (GO) terms are often used to interpret the results of microarray experiments. The most common approach is to perform Fisher's exact tests to find gene sets anno...
Igor Trajkovski, Nada Lavrac, Jakub Tolar