Sciweavers

230 search results - page 37 / 46
» Testing Closeness of Discrete Distributions
Sort
View
JASIS
2007
122views more  JASIS 2007»
14 years 9 months ago
Exploiting parallelism to support scalable hierarchical clustering
A distributed memory parallel version of the group average Hierarchical Agglomerative Clustering algorithm is proposed to enable scaling the document clustering problem to large c...
Rebecca Cathey, Eric C. Jensen, Steven M. Beitzel,...
PRL
2007
146views more  PRL 2007»
14 years 9 months ago
Neighbor number, valley seeking and clustering
This paper proposes a novel nonparametric clustering algorithm capable of identifying shape-free clusters. This algorithm is based on a nonparametric estimation of the normalized ...
Chaolin Zhang, Xuegong Zhang, Michael Q. Zhang, Ya...
CORR
2011
Springer
190views Education» more  CORR 2011»
14 years 1 months ago
Doubly Robust Smoothing of Dynamical Processes via Outlier Sparsity Constraints
Abstract—Coping with outliers contaminating dynamical processes is of major importance in various applications because mismatches from nominal models are not uncommon in practice...
Shahrokh Farahmand, Georgios B. Giannakis, Daniele...
ACL
2012
13 years 9 days ago
Discriminative Pronunciation Modeling: A Large-Margin, Feature-Rich Approach
We address the problem of learning the mapping between words and their possible pronunciations in terms of sub-word units. Most previous approaches have involved generative modeli...
Hao Tang, Joseph Keshet, Karen Livescu
ICS
2010
Tsinghua U.
15 years 7 months ago
Cryptography by Cellular Automata or How Fast Can Complexity Emerge in Nature?
Computation in the physical world is restricted by the following spatial locality constraint: In a single unit of time, information can only travel a bounded distance in space. A ...
Benny Applebaum, Yuval Ishai, Eyal Kushilevitz