Sciweavers

496 search results - page 91 / 100
» A Polynomial-Time Approximation Algorithm for a Geometric Di...
Sort
View
STACS
2001
Springer
15 years 6 months ago
On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs
We consider the problem of computing an optimal range assignment in a wireless network which allows a specified source station to perform a broadcast operation. In particular, we ...
Andrea E. F. Clementi, Pierluigi Crescenzi, Paolo ...
ECCV
2010
Springer
15 years 6 months ago
Geometry Construction from Caustic Images
In this work we investigate an inverse geometry problem. Given a light source, a diffuse plane and a caustic image, how must a geometric object look like (transmissive or reflect...
COLT
2008
Springer
15 years 4 months ago
Finding Metric Structure in Information Theoretic Clustering
We study the problem of clustering discrete probability distributions with respect to the Kullback-Leibler (KL) divergence. This problem arises naturally in many applications. Our...
Kamalika Chaudhuri, Andrew McGregor
IDEAL
2005
Springer
15 years 8 months ago
Differential Priors for Elastic Nets
The elastic net and related algorithms, such as generative topographic mapping, are key methods for discretized dimension-reduction problems. At their heart are priors that specify...
Miguel Á. Carreira-Perpiñán, ...
CAGD
2005
112views more  CAGD 2005»
15 years 2 months ago
Estimating differential quantities using polynomial fitting of osculating jets
This paper addresses the point-wise estimation of differential properties of a smooth manifold S--a curve in the plane or a surface in 3D--assuming a point cloud sampled over S is...
Frédéric Cazals, Marc Pouget