Sciweavers

77 search results - page 8 / 16
» Approximating Functions From Sampled Fourier Data Using Spli...
Sort
View
SGP
2003
13 years 8 months ago
Approximating and Intersecting Surfaces from Points
Point sets become an increasingly popular shape representation. Most shape processing and rendering tasks require the approximation of a continuous surface from the point data. We...
Anders Adamson, Marc Alexa
PODS
2006
ACM
134views Database» more  PODS 2006»
14 years 6 months ago
Approximate quantiles and the order of the stream
Recently, there has been an increased focus on modeling uncertainty by distributions. Suppose we wish to compute a function of a stream whose elements are samples drawn independen...
Sudipto Guha, Andrew McGregor
NIPS
2007
13 years 8 months ago
Consistent Minimization of Clustering Objective Functions
Clustering is often formulated as a discrete optimization problem. The objective is to find, among all partitions of the data set, the best one according to some quality measure....
Ulrike von Luxburg, Sébastien Bubeck, Stefa...
CVIU
2007
152views more  CVIU 2007»
13 years 6 months ago
A random sampling strategy for piecewise planar scene segmentation
We investigate the problem of automatically creating 3D models of man-made environments that we represent as collections of textured planes. A typical approach is to automatically...
Adrien Bartoli
ILP
2004
Springer
14 years 2 days ago
Learning an Approximation to Inductive Logic Programming Clause Evaluation
One challenge faced by many Inductive Logic Programming (ILP) systems is poor scalability to problems with large search spaces and many examples. Randomized search methods such as ...
Frank DiMaio, Jude W. Shavlik