Sciweavers

220 search results - page 13 / 44
» A Pseudo-Metric for Weighted Point Sets
Sort
View
KDD
2009
ACM
298views Data Mining» more  KDD 2009»
14 years 3 months ago
Mind the gaps: weighting the unknown in large-scale one-class collaborative filtering
One-Class Collaborative Filtering (OCCF) is a task that naturally emerges in recommender system settings. Typical characteristics include: Only positive examples can be observed, ...
Rong Pan, Martin Scholz
CORR
2010
Springer
168views Education» more  CORR 2010»
13 years 5 months ago
Bounds on the maximum multiplicity of some common geometric graphs
We obtain new lower and upper bounds for the maximum multiplicity of some weighted and, respectively, non-weighted common geometric graphs drawn on n points in the plane in genera...
Adrian Dumitrescu, André Schulz, Adam Sheff...
JMM2
2006
146views more  JMM2 2006»
13 years 8 months ago
Probabilistic Algorithms, Integration, and Empirical Evaluation for Disambiguating Multiple Selections in Frustum-Based Pointing
There are a few fundamental pointing-based user interface techniques for performing selections in 3D environments. One of these techniques is ray pointing, which makes selections b...
Greg S. Schmidt, Dennis G. Brown, Erik B. Tomlin, ...
SIAMJO
2011
13 years 3 months ago
Minimizing the Condition Number of a Gram Matrix
Abstract. The condition number of a Gram matrix defined by a polynomial basis and a set of points is often used to measure the sensitivity of the least squares polynomial approxim...
Xiaojun Chen, Robert S. Womersley, Jane J. Ye
COMPGEOM
2010
ACM
14 years 1 months ago
Approximating loops in a shortest homology basis from point data
Inference of topological and geometric attributes of a hidden manifold from its point data is a fundamental problem arising in many scientific studies and engineering application...
Tamal K. Dey, Jian Sun, Yusu Wang