Sciweavers

126 search results - page 8 / 26
» Finding minimal bases in arbitrary spline spaces
Sort
View
BMCBI
2010
178views more  BMCBI 2010»
15 years 6 months ago
Selecting high-dimensional mixed graphical models using minimal AIC or BIC forests
Background: Chow and Liu showed that the maximum likelihood tree for multivariate discrete distributions may be found using a maximum weight spanning tree algorithm, for example K...
David Edwards, Gabriel C. G. de Abreu, Rodrigo Lab...
CAD
2006
Springer
15 years 6 months ago
A unified subdivision approach for multi-dimensional non-manifold modeling
This paper presents a new unified subdivision scheme that is defined over a k-simplicial complex in n-D space with k 3. We first present a series of definitions to facilitate top...
Yu-Sung Chang, Hong Qin
ESA
2010
Springer
246views Algorithms» more  ESA 2010»
15 years 7 months ago
Estimating the Average of a Lipschitz-Continuous Function from One Sample
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
Abhimanyu Das, David Kempe
MOBICOM
2010
ACM
15 years 6 months ago
The spaces between us: setting and maintaining boundaries in wireless spectrum access
Guardbands are designed to insulate transmissions on adjacent frequencies from mutual interference. As more devices in a given area are packed into orthogonal wireless channels, c...
Lei Yang, Ben Y. Zhao, Haitao Zheng
TALG
2010
158views more  TALG 2010»
15 years 23 days ago
Clustering for metric and nonmetric distance measures
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P of size n, our goal is to find a set C of size k such t...
Marcel R. Ackermann, Johannes Blömer, Christi...