Sciweavers

895 search results - page 46 / 179
» Approximate convex decomposition
Sort
View
UAI
2008
14 years 11 months ago
Clique Matrices for Statistical Graph Decomposition and Parameterising Restricted Positive Definite Matrices
We introduce Clique Matrices as an alternative representation of undirected graphs, being a generalisation of the incidence matrix representation. Here we use clique matrices to d...
David Barber
PODS
2004
ACM
207views Database» more  PODS 2004»
15 years 10 months ago
Adaptive Sampling for Geometric Problems over Data Streams
Geometric coordinates are an integral part of many data streams. Examples include sensor locations in environmental monitoring, vehicle locations in traffic monitoring or battlefi...
John Hershberger, Subhash Suri
CGI
1998
IEEE
15 years 2 months ago
Hierarchical Decomposition of Datasets on Irregular Surface Meshes
In this paper we introduce multiresolution analysis (MRA) algorithmsintendedto be used in scientific visualization,and basedon a non-nestedset ofapproximatingspaces. The need for ...
Georges-Pierre Bonneau, Alexandre Gerussi
CVPR
1996
IEEE
15 years 1 months ago
Sparse Representations for Image Decomposition with Occlusions
We study the problem of how to detect \interesting objects" appeared in a given image, I. Our approach is to treat it as a function approximation problem based on an over-red...
Michael J. Donahue, Davi Geiger, Tyng-Luh Liu, Rob...
CORR
2004
Springer
103views Education» more  CORR 2004»
14 years 9 months ago
Online convex optimization in the bandit setting: gradient descent without a gradient
We study a general online convex optimization problem. We have a convex set S and an unknown sequence of cost functions c1, c2, . . . , and in each period, we choose a feasible po...
Abraham Flaxman, Adam Tauman Kalai, H. Brendan McM...