Sciweavers

631 search results - page 68 / 127
» Additive Approximation for Edge-Deletion Problems
Sort
View
FOCS
2004
IEEE
14 years 1 months ago
Worst-Case to Average-Case Reductions Based on Gaussian Measures
We show that finding small solutions to random modular linear equations is at least as hard as approximating several lattice problems in the worst case within a factor almost line...
Daniele Micciancio, Oded Regev
BMVC
2010
13 years 8 months ago
Generalized RBF feature maps for Efficient Detection
Kernel methods yield state-of-the-art performance in certain applications such as image classification and object detection. However, large scale problems require machine learning...
Sreekanth Vempati, Andrea Vedaldi, Andrew Zisserma...
AIPS
2004
13 years 11 months ago
Optimal Rectangle Packing: New Results
We present new results on the problem of finding an enclosing rectangle of minimum area that will contain a given a set of rectangles. Many simple scheduling tasks can be modelled...
Richard E. Korf
COMPGEOM
2011
ACM
13 years 1 months ago
Persistence-based clustering in riemannian manifolds
We present a clustering scheme that combines a mode-seeking phase with a cluster merging phase in the corresponding density map. While mode detection is done by a standard graph-b...
Frédéric Chazal, Leonidas J. Guibas,...
VISUALIZATION
1997
IEEE
14 years 2 months ago
Multiresolution compression and reconstruction
This paper presents a framework for multiresolution compression and geometric reconstruction of arbitrarily dimensioned data designed for distributed applications. Although being ...
Oliver G. Staadt, Markus H. Gross, Roger Weber