Sciweavers

1016 search results - page 193 / 204
» Generalized distances between rankings
Sort
View
TIT
2002
126views more  TIT 2002»
14 years 11 months ago
Two-dimensional interleaving schemes with repetitions: Constructions and bounds
Abstract--Two-dimensional interleaving schemes with repetitions are considered. These schemes are required for the correction of two-dimensional bursts (or clusters) of errors in a...
Tuvi Etzion, Alexander Vardy
77
Voted
PR
2007
100views more  PR 2007»
14 years 11 months ago
Linear manifold clustering in high dimensional spaces by stochastic search
Classical clustering algorithms are based on the concept that a cluster center is a single point. Clusters which are not compact around a single point are not candidates for class...
Robert M. Haralick, Rave Harpaz
TSMC
2011
228views more  TSMC 2011»
14 years 6 months ago
Privacy-Preserving Outlier Detection Through Random Nonlinear Data Distortion
— Consider a scenario in which the data owner has some private/sensitive data and wants a data miner to access it for studying important patterns without revealing the sensitive ...
Kanishka Bhaduri, Mark D. Stefanski, Ashok N. Sriv...
WWW
2011
ACM
14 years 6 months ago
Consideration set generation in commerce search
In commerce search, the set of products returned by a search engine often forms the basis for all user interactions leading up to a potential transaction on the web. Such a set of...
Sayan Bhattacharya, Sreenivas Gollapudi, Kamesh Mu...
BMCBI
2010
123views more  BMCBI 2010»
14 years 12 months ago
eGIFT: Mining Gene Information from the Literature
Background: With the biomedical literature continually expanding, searching PubMed for information about specific genes becomes increasingly difficult. Not only can thousands of r...
Catalina O. Tudor, Carl J. Schmidt, K. Vijay-Shank...