Sciweavers

4886 search results - page 356 / 978
» Approximate Data Exchange
Sort
View
ICML
1996
IEEE
16 years 7 months ago
Toward Optimal Feature Selection
In this paper, we examine a method for feature subset selection based on Information Theory. Initially, a framework for de ning the theoretically optimal, but computationally intr...
Daphne Koller, Mehran Sahami
ICASSP
2008
IEEE
16 years 1 months ago
Performance analysis of the cepstral technique for frequency-domain optical-coherence tomography
Recently, we proposed a noniterative cepstral technique for exact signal recovery in frequency-domain optical-coherence tomography. In this paper, we address the influence of mea...
S. Chandra Sekhar, Michael Unser
PG
2007
IEEE
16 years 27 days ago
Papercraft Models using Generalized Cylinders
We introduce an algorithm for approximating a 2manifold 3D mesh by a set of developable surfaces. Each developable surface is a generalized cylinder represented as a strip of tria...
Fady Massarwi, Craig Gotsman, Gershon Elber
COCOON
2007
Springer
16 years 24 days ago
Priority Algorithms for the Subset-Sum Problem
Greedy algorithms are simple, but their relative power is not well understood. The priority framework [5] captures a key notion of “greediness” in the sense that it processes (...
Yuli Ye, Allan Borodin
FOCS
2006
IEEE
16 years 21 days ago
On the Optimality of the Dimensionality Reduction Method
We investigate the optimality of (1+ )-approximation algorithms obtained via the dimensionality reduction method. We show that: • Any data structure for the (1 + )-approximate n...
Alexandr Andoni, Piotr Indyk, Mihai Patrascu