Sciweavers

2520 search results - page 300 / 504
» The complexity of approximating entropy
Sort
View
SIAMNUM
2011
117views more  SIAMNUM 2011»
15 years 1 months ago
Construction and Convergence Study of Schemes Preserving the Elliptic Local Maximum Principle
We present a method to approximate (in any space dimension) diffusion equations with schemes having a specific structure; this structure ensures that the discrete local maximum a...
Jérôme Droniou, Christophe Le Potier
ICASSP
2011
IEEE
14 years 10 months ago
Interference alignment in single-beam MIMO networks via homotopy continuation
In this paper we consider the application of a homotopy-continuation based method for finding interference alignment (IA) solutions for the deterministic K-user multiple-input mu...
Oscar Gonzalez, Ignacio Santamaría
EDBT
2011
ACM
231views Database» more  EDBT 2011»
14 years 10 months ago
Data integration with dependent sources
Data integration systems offer users a uniform interface to a set of data sources. Previous work has typically assumed that the data sources are independent of each other; however...
Anish Das Sarma, Xin Luna Dong, Alon Y. Halevy
COMGEO
2012
ACM
14 years 2 months ago
Algorithms for the edge-width of an embedded graph
Let G be an unweighted graph of complexity n embedded in a surface of genus g, orientable or not. We describe improved algorithms to compute a shortest non-contractible and a shor...
Sergio Cabello, Éric Colin de Verdiè...
CVPR
2012
IEEE
13 years 9 months ago
Boosting algorithms for simultaneous feature extraction and selection
The problem of simultaneous feature extraction and selection, for classifier design, is considered. A new framework is proposed, based on boosting algorithms that can either 1) s...
Mohammad J. Saberian, Nuno Vasconcelos