Sciweavers

1604 search results - page 267 / 321
» Regularization on Discrete Spaces
Sort
View
ESA
2010
Springer
246views Algorithms» more  ESA 2010»
13 years 8 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
PPDP
2010
Springer
13 years 5 months ago
Precise complexity analysis for efficient datalog queries
Given a set of Datalog rules, facts, and a query, answers to the query can be inferred bottom-up starting with the facts or top-down starting with the query. For efficiently answe...
K. Tuncay Tekle, Yanhong A. Liu
IEEEVAST
2010
13 years 2 months ago
Finding and visualizing relevant subspaces for clustering high-dimensional astronomical data using connected morphological opera
Data sets in astronomy are growing to enormous sizes. Modern astronomical surveys provide not only image data but also catalogues of millions of objects (stars, galaxies), each ob...
Bilkis J. Ferdosi, Hugo Buddelmeijer, Scott Trager...
DAGSTUHL
2011
12 years 7 months ago
Interactive Isocontouring of High-Order Surfaces
Scientists and engineers are making increasingly use of hp-adaptive discretization methods to compute simulations. While techniques for isocontouring the high-order data generated...
Christian Azambuja Pagot, Joachim E. Vollrath, Fil...
CVPR
1998
IEEE
14 years 9 months ago
The Sample Tree: A Sequential Hypothesis Testing Approach to 3D Object Recognition
A method is presented for e cient and reliable object recognition within noisy, cluttered, and occluded range images. The method is based on a strategy which hypothesizes the inte...
Michael A. Greenspan