Sciweavers

2526 search results - page 30 / 506
» A New Algorithm for Answer Set Computation
Sort
View
ICDM
2008
IEEE
115views Data Mining» more  ICDM 2008»
14 years 3 months ago
Toward Faster Nonnegative Matrix Factorization: A New Algorithm and Comparisons
Nonnegative Matrix Factorization (NMF) is a dimension reduction method that has been widely used for various tasks including text mining, pattern analysis, clustering, and cancer ...
Jingu Kim, Haesun Park
SDM
2011
SIAM
241views Data Mining» more  SDM 2011»
13 years 9 hour ago
A Fast Algorithm for Sparse PCA and a New Sparsity Control Criteria
Sparse principal component analysis (PCA) imposes extra constraints or penalty terms to the standard PCA to achieve sparsity. In this paper, we first introduce an efficient algor...
Yunlong He, Renato Monteiro, Haesun Park
ICPR
2008
IEEE
14 years 10 months ago
New extensions of the 3-simplex for exterior orientation
Object pose may be determined from a set of 2D image points and corresponding 3D model points, given the camera's intrinsic parameters. In this paper, two new exterior orient...
John Martin Steinbis, Tyrone Vincent, William A. H...
STACS
2007
Springer
14 years 3 months ago
New Approximation Algorithms for Minimum Cycle Bases of Graphs
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...
Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Mich...
SBACPAD
2003
IEEE
180views Hardware» more  SBACPAD 2003»
14 years 2 months ago
New Parallel Algorithms for Frequent Itemset Mining in Very Large Databases
Frequent itemset mining is a classic problem in data mining. It is a non-supervised process which concerns in finding frequent patterns (or itemsets) hidden in large volumes of d...
Adriano Veloso, Wagner Meira Jr., Srinivasan Parth...