Sciweavers

238 search results - page 35 / 48
» A Constraint Learning Algorithm for Blind Source Separation
Sort
View
CVPR
2007
IEEE
14 years 9 months ago
Adaptive Distance Metric Learning for Clustering
A good distance metric is crucial for unsupervised learning from high-dimensional data. To learn a metric without any constraint or class label information, most unsupervised metr...
Jieping Ye, Zheng Zhao, Huan Liu
EMNLP
2011
12 years 7 months ago
Multi-Source Transfer of Delexicalized Dependency Parsers
We present a simple method for transferring dependency parsers from source languages with labeled training data to target languages without labeled training data. We first demons...
Ryan T. McDonald, Slav Petrov, Keith Hall
MSE
2002
IEEE
198views Hardware» more  MSE 2002»
14 years 19 days ago
BSS: A New Approach for Watermark Attack
Digital watermarking is the enabling technology to prove ownership on copyrighted material, detect originators of illegally made copies, monitor the usage of the copyrighted multi...
Jiang Du, Choong-Hoon Lee, Heung-Kyu Lee, Young-Ho...
ML
2010
ACM
135views Machine Learning» more  ML 2010»
13 years 2 months ago
Multi-domain learning by confidence-weighted parameter combination
State-of-the-art statistical NLP systems for a variety of tasks learn from labeled training data that is often domain specific. However, there may be multiple domains or sources o...
Mark Dredze, Alex Kulesza, Koby Crammer
ISNN
2005
Springer
14 years 1 months ago
One-Bit-Matching ICA Theorem, Convex-Concave Programming, and Combinatorial Optimization
Recently, a mathematical proof is obtained in (Liu, Chiu, Xu, 2004) on the so called one-bit-matching conjecture that all the sources can be separated as long as there is an one-to...
Lei Xu