Sciweavers

170 search results - page 6 / 34
» Cross-Composition: A New Technique for Kernelization Lower B...
Sort
View
APPROX
2010
Springer
168views Algorithms» more  APPROX 2010»
15 years 1 months ago
Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners
Abstract. Given a directed graph G = (V, E) and an integer k 1, a ktransitive-closure-spanner (k-TC-spanner) of G is a directed graph H = (V, EH ) that has (1) the same transitive...
Arnab Bhattacharyya, Elena Grigorescu, Madhav Jha,...
109
Voted
COMPGEOM
1995
ACM
15 years 3 months ago
A New Technique for Analyzing Substructures in Arrangements
We present a simple but powerful new probabilistic technique for analyzing the combinatorial complexity of various substructures in arrangements of piecewise-linear surfaces in hig...
Boaz Tagansky
ICML
2004
IEEE
16 years 14 days ago
K-means clustering via principal component analysis
Principal component analysis (PCA) is a widely used statistical technique for unsupervised dimension reduction. K-means clustering is a commonly used data clustering for unsupervi...
Chris H. Q. Ding, Xiaofeng He
ICASSP
2011
IEEE
14 years 3 months ago
Subspace-based DOA estimation using Fractional Lower Order statistics
Direction Of Arrival (DOA) estimation, using a sensor array, in the presence of non-Gaussian noise using Fractional Lower-Order Moments (FLOM)matrices is studied. In this paper, a...
K. V. S. Hari, V. Lalitha
CORR
2010
Springer
128views Education» more  CORR 2010»
14 years 11 months ago
Sublinear Optimization for Machine Learning
Abstract--We give sublinear-time approximation algorithms for some optimization problems arising in machine learning, such as training linear classifiers and finding minimum enclos...
Kenneth L. Clarkson, Elad Hazan, David P. Woodruff