Sciweavers

957 search results - page 46 / 192
» From Margin to Sparsity
Sort
View
ISSAC
2004
Springer
106views Mathematics» more  ISSAC 2004»
14 years 1 months ago
Factoring polynomials via polytopes
We introduce a new approach to multivariate polynomial factorisation which incorporates ideas from polyhedral geometry, and generalises Hensel lifting. Our main contribution is to...
Fatima Abu Salem, Shuhong Gao, Alan G. B. Lauder
ESA
2003
Springer
123views Algorithms» more  ESA 2003»
14 years 1 months ago
Experiments on Graph Clustering Algorithms
A promising approach to graph clustering is based on the intuitive notion of intra-cluster density vs. inter-cluster sparsity. While both formalizations and algorithms focusing on ...
Ulrik Brandes, Marco Gaertler, Dorothea Wagner
ESWS
2008
Springer
13 years 9 months ago
Microsearch: An Interface for Semantic Search
In this paper we discuss the potential for semantic search and focus on the most immediate problem toward its realization: the problem of the sparsity and relatively low quality of...
Peter Mika
NIPS
2004
13 years 9 months ago
Bayesian Regularization and Nonnegative Deconvolution for Time Delay Estimation
Bayesian Regularization and Nonnegative Deconvolution (BRAND) is proposed for estimating time delays of acoustic signals in reverberant environments. Sparsity of the nonnegative f...
Yuanqing Lin, Daniel D. Lee
CORR
2010
Springer
72views Education» more  CORR 2010»
13 years 6 months ago
A Generalized Sampling Theorem for Reconstructions in Arbitrary Bases
—We present a generalized sampling theorem allowing reconstructions in arbitrary bases. The classical Shannon Sampling Theorem is a special case of our theorem. Specifically, we...
Ben Adcock, Anders C. Hansen