Sciweavers

6315 search results - page 176 / 1263
» Approximating Solution Structure
Sort
View
TSP
2008
91views more  TSP 2008»
15 years 6 months ago
Nonlinear and Nonideal Sampling: Theory and Methods
We study a sampling setup where a continuous-time signal is mapped by a memoryless, invertible and nonlinear transformation, and then sampled in a nonideal manner. Such scenarios a...
Tsvi G. Dvorkind, Yonina C. Eldar, Ewa Matusiak
CGF
2008
98views more  CGF 2008»
15 years 6 months ago
Surface Reconstruction from Unorganized Point Data with Quadrics
We present a reverse engineering method for constructing a surface approximation scheme whose input is a set of unorganized noisy points in space and whose output is a set of quad...
Marek Vanco, Bernd Hamann, Guido Brunnett
ICALP
2003
Springer
15 years 11 months ago
The Cell Probe Complexity of Succinct Data Structures
Abstract. We show lower bounds in the cell probe model for the redundancy/query time tradeoff of solutions to static data structure problems.
Anna Gál, Peter Bro Miltersen
STOC
2006
ACM
152views Algorithms» more  STOC 2006»
16 years 6 months ago
Private approximation of search problems
Many approximation algorithms have been presented in the last decades for hard search problems. The focus of this paper is on cryptographic applications, where it is desired to de...
Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb
VLDB
2007
ACM
134views Database» more  VLDB 2007»
16 years 18 days ago
Building Structured Web Community Portals: A Top-Down, Compositional, and Incremental Approach
Structured community portals extract and integrate information from raw Web pages to present a unified view of entities and relationships in the community. In this paper we argue...
Pedro DeRose, Warren Shen, Fei Chen 0002, AnHai Do...