Sciweavers

169 search results - page 27 / 34
» Reductions among high dimensional proximity problems
Sort
View
CVPR
2010
IEEE
14 years 3 months ago
SPEC Hashing: Similarity Preserving algorithm for Entropy-based Coding
Searching approximate nearest neighbors in large scale high dimensional data set has been a challenging problem. This paper presents a novel and fast algorithm for learning binary...
Ruei-Sung Lin, David Ross, Jay Yagnik
CORR
2010
Springer
65views Education» more  CORR 2010»
13 years 7 months ago
On Unconditionally Secure Computation with Vanishing Communication Cost
We propose a novel distortion-theoretic approach to a secure three-party computation problem. Alice and Bob have deterministic sequences, and Charlie wishes to compute a normalize...
Ye Wang, Shantanu Rane, Wei Sun, Prakash Ishwar
ECAI
2010
Springer
13 years 4 months ago
Feature Selection by Approximating the Markov Blanket in a Kernel-Induced Space
The proposed feature selection method aims to find a minimum subset of the most informative variables for classification/regression by efficiently approximating the Markov Blanket ...
Qiang Lou, Zoran Obradovic
ASIACRYPT
2005
Springer
14 years 1 months ago
Adapting Density Attacks to Low-Weight Knapsacks
Cryptosystems based on the knapsack problem were among the first public-key systems to be invented. Their high encryption/decryption rate attracted considerable interest until it ...
Phong Q. Nguyen, Jacques Stern
BMCBI
2011
12 years 11 months ago
Inference of Chromosome-Specific Copy Numbers Using Population Haplotypes
Background: Using microarray and sequencing platforms, a large number of copy number variations (CNVs) have been identified in humans. In practice, because our human genome is a d...
Yao-Ting Huang, Min-Han Wu