Sciweavers

1670 search results - page 207 / 334
» Fast Computation of Data Correlation Using BDDs
Sort
View
ICDM
2009
IEEE
172views Data Mining» more  ICDM 2009»
15 years 10 months ago
Sparse Least-Squares Methods in the Parallel Machine Learning (PML) Framework
—We describe parallel methods for solving large-scale, high-dimensional, sparse least-squares problems that arise in machine learning applications such as document classificatio...
Ramesh Natarajan, Vikas Sindhwani, Shirish Tatikon...
IJFCS
2002
122views more  IJFCS 2002»
15 years 2 months ago
The Delaunay Hierarchy
We propose a new data structure to compute the Delaunay triangulation of a set of points in the plane. It combines good worst case complexity, fast behavior on real data, small me...
Olivier Devillers
ANOR
2010
139views more  ANOR 2010»
15 years 1 months ago
Some operations research methods for analyzing protein sequences and structures
Operations Research is probably one of the most successful fields of applied mathematics used in Economics, Physics, Chemistry, almost everywhere onehastoanalyzehugeamountsofdata.L...
Piotr Lukasiak, Jacek Blazewicz, Maciej Milostan
UAI
1997
15 years 4 months ago
Exploring Parallelism in Learning Belief Networks
It has been shown that a class of probabilistic domain models cannot be learned correctly by several existing algorithms which employ a single-link lookahead search. When a multil...
Tongsheng Chu, Yang Xiang
121
Voted
ICDM
2009
IEEE
149views Data Mining» more  ICDM 2009»
15 years 10 months ago
Accelerated Gradient Method for Multi-task Sparse Learning Problem
—Many real world learning problems can be recast as multi-task learning problems which utilize correlations among different tasks to obtain better generalization performance than...
Xi Chen, Weike Pan, James T. Kwok, Jaime G. Carbon...