Sciweavers

705 search results - page 55 / 141
» Approximating Extended Answer Sets
Sort
View
MLDM
2008
Springer
15 years 6 months ago
Distributed Monitoring of Frequent Items
Monitoring frequently occuring items is a recurring task in a variety of applications. Although a number of solutions have been proposed there has been few to address the problem i...
Robert Fuller, Mehmed M. Kantardzic
ICDT
2005
ACM
128views Database» more  ICDT 2005»
15 years 11 months ago
The Pipelined Set Cover Problem
Abstract. A classical problem in query optimization is to find the optimal ordering of a set of possibly correlated selections. We provide an ion of this problem as a generalizati...
Kamesh Munagala, Shivnath Babu, Rajeev Motwani, Je...
SIGECOM
2009
ACM
137views ECommerce» more  SIGECOM 2009»
16 years 19 days ago
An exact almost optimal algorithm for target set selection in social networks
The Target Set Selection problem proposed by Kempe, Kleinberg, and Tardos, gives a nice clean combinatorial formulation for many problems arising in economy, sociology, and medicin...
Oren Ben-Zwi, Danny Hermelin, Daniel Lokshtanov, I...
SIGECOM
2009
ACM
216views ECommerce» more  SIGECOM 2009»
16 years 19 days ago
Approximate mechanism design without money
The literature on algorithmic mechanism design is mostly concerned with game-theoretic versions of optimization problems to which standard economic money-based mechanisms cannot b...
Ariel D. Procaccia, Moshe Tennenholtz
CIKM
2000
Springer
15 years 10 months ago
Dimensionality Reduction and Similarity Computation by Inner Product Approximations
—As databases increasingly integrate different types of information such as multimedia, spatial, time-series, and scientific data, it becomes necessary to support efficient retri...
Ömer Egecioglu, Hakan Ferhatosmanoglu