Sciweavers

3475 search results - page 164 / 695
» Backbones in Optimization and Approximation
Sort
View
KDD
2004
ACM
158views Data Mining» more  KDD 2004»
16 years 6 months ago
A generalized maximum entropy approach to bregman co-clustering and matrix approximation
Co-clustering is a powerful data mining technique with varied applications such as text clustering, microarray analysis and recommender systems. Recently, an informationtheoretic ...
Arindam Banerjee, Inderjit S. Dhillon, Joydeep Gho...
EDBT
2010
ACM
110views Database» more  EDBT 2010»
16 years 1 months ago
The hardness and approximation algorithms for l-diversity
The existing solutions to privacy preserving publication can be classified into the theoretical and heuristic categories. The former guarantees provably low information loss, whe...
Xiaokui Xiao, Ke Yi, Yufei Tao
INFOCOM
2008
IEEE
16 years 24 days ago
On the Construction of a Maximum-Lifetime Data Gathering Tree in Sensor Networks: NP-Completeness and Approximation Algorithm
Abstract—Energy efficiency is critical for wireless sensor networks. The data gathering process must be carefully designed to conserve energy and extend the network lifetime. Fo...
Yan Wu, Sonia Fahmy, Ness B. Shroff
ACIVS
2008
Springer
16 years 23 days ago
Sub-optimal Camera Selection in Practical Vision Networks through Shape Approximation
Within a camera network, the contribution of a camera to the observations of a scene depends on its viewpoint and on the scene configuration. This is a dynamic property, as the sc...
Huang Lee, Linda Tessens, Marleen Morbée, H...
CIKM
2004
Springer
15 years 11 months ago
Approximating the top-m passages in a parallel question answering system
We examine the problem of retrieving the top-m ranked items from a large collection, randomly distributed across an n-node system. In order to retrieve the top m overall, we must ...
Charles L. A. Clarke, Egidio L. Terra