Sciweavers

4112 search results - page 311 / 823
» Efficient Algorithms for the Spoonerism Problem
Sort
View
ICDM
2009
IEEE
188views Data Mining» more  ICDM 2009»
15 years 4 months ago
Binomial Matrix Factorization for Discrete Collaborative Filtering
Matrix factorization (MF) models have proved efficient and well scalable for collaborative filtering (CF) problems. Many researchers also present the probabilistic interpretation o...
Jinlong Wu
CAP
2010
15 years 1 months ago
Parallel disk-based computation for large, monolithic binary decision diagrams
Binary Decision Diagrams (BDDs) are widely used in formal verification. They are also widely known for consuming large amounts of memory. For larger problems, a BDD computation wi...
Daniel Kunkle, Vlad Slavici, Gene Cooperman
TMC
2010
167views more  TMC 2010»
15 years 1 months ago
Optimal Speed Control of Mobile Node for Data Collection in Sensor Networks
A data mule represents a mobile device that collects data in a sensor field by physically visiting the nodes in a sensor network. The data mule collects data when it is in the prox...
Ryo Sugihara, Rajesh K. Gupta
TKDE
2012
245views Formal Methods» more  TKDE 2012»
13 years 9 months ago
Semi-Supervised Maximum Margin Clustering with Pairwise Constraints
—The pairwise constraints specifying whether a pair of samples should be grouped together or not have been successfully incorporated into the conventional clustering methods such...
Hong Zeng, Yiu-ming Cheung
ACL
2008
15 years 8 months ago
Semi-Supervised Convex Training for Dependency Parsing
We present a novel semi-supervised training algorithm for learning dependency parsers. By combining a supervised large margin loss with an unsupervised least squares loss, a discr...
Qin Iris Wang, Dale Schuurmans, Dekang Lin