Sciweavers

1389 search results - page 37 / 278
» Improved Approximation Algorithms for Label Cover Problems
Sort
View
STOC
2006
ACM
152views Algorithms» more  STOC 2006»
15 years 12 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
COCOA
2009
Springer
15 years 3 months ago
An Effective Hybrid Algorithm for the Circles and Spheres Packing Problems
stract to be announcedPlenary session 09:00-10:00 Panos M, Pardalos, University of Florida, USA Tea Break 10:00-10:20 At the 1st floor 10:20-10:45 Polynomial Approximation Schemes ...
Jingfa Liu, Yonglei Yao, Yu Zheng, Huantong Geng, ...
DEXA
2009
Springer
153views Database» more  DEXA 2009»
15 years 3 months ago
Three Approximation Algorithms for Energy-Efficient Query Dissemination in Sensor Database System
Abstract. Sensor database is a type of database management system which offers sensor data and stored data in its data model and query languages. In this system, when a user poses ...
Zhao Zhang, Xiaofeng Gao, Xuefei Zhang, Weili Wu, ...
ICML
2010
IEEE
15 years 23 days ago
Interactive Submodular Set Cover
We introduce a natural generalization of submodular set cover and exact active learning with a finite hypothesis class (query learning). We call this new problem interactive submo...
Andrew Guillory, Jeff Bilmes
DAC
2009
ACM
16 years 21 days ago
Provably good and practically efficient algorithms for CMP dummy fill
Abstract--To reduce chip-scale topography variation in Chemical Mechanical Polishing (CMP) process, dummy fill is widely used to improve the layout density uniformity. Previous res...
Chunyang Feng, Hai Zhou, Changhao Yan, Jun Tao, Xu...