Sciweavers

1640 search results - page 80 / 328
» Deriving Private Information from Randomized Data
Sort
View
NIPS
2003
14 years 11 months ago
Geometric Clustering Using the Information Bottleneck Method
We argue that K–means and deterministic annealing algorithms for geometric clustering can be derived from the more general Information Bottleneck approach. If we cluster the ide...
Susanne Still, William Bialek, Léon Bottou
JOLLI
2007
79views more  JOLLI 2007»
14 years 9 months ago
Supplementing Entity Coherence with Local Rhetorical Relations for Information Ordering
This paper investigates whether the model of local rhetorical coherence suggested in Knott et al. (2001) can boost the performance of the Centering-based metrics of entity coheren...
Nikiforos Karamanis
ICPR
2010
IEEE
14 years 12 months ago
Compressing Sparse Feature Vectors Using Random Ortho-Projections
In this paper we investigate the usage of random ortho-projections in the compression of sparse feature vectors. The study is carried out by evaluating the compressed features in ...
Esa Rahtu, Mikko Salo, Janne Heikkilä
BMCBI
2010
133views more  BMCBI 2010»
14 years 10 months ago
Improving de novo sequence assembly using machine learning and comparative genomics for overlap correction
Background: With the rapid expansion of DNA sequencing databases, it is now feasible to identify relevant information from prior sequencing projects and completed genomes and appl...
Lance E. Palmer, Mathäus Dejori, Randall A. B...
CVPR
2004
IEEE
15 years 12 months ago
Random Sampling LDA for Face Recognition
Linear Discriminant Analysis (LDA) is a popular feature extraction technique for face recognition. However, It often suffers from the small sample size problem when dealing with t...
Xiaogang Wang, Xiaoou Tang