Sciweavers

197 search results - page 19 / 40
» Improved Approximation Algorithms for Bipartite Correlation ...
Sort
View
SDM
2003
SIAM
110views Data Mining» more  SDM 2003»
13 years 8 months ago
Mixture Models and Frequent Sets: Combining Global and Local Methods for 0-1 Data
We study the interaction between global and local techniques in data mining. Specifically, we study the collections of frequent sets in clusters produced by a probabilistic clust...
Jaakko Hollmén, Jouni K. Seppänen, Hei...
CGF
1999
79views more  CGF 1999»
13 years 7 months ago
A Practical Analysis of Clustering Strategies for Hierarchical Radiosity
The calculation of radiant energy balance in complex scenes has been made possible by hierarchical radiosity methods based on clustering mechanisms. Although clustering offers an ...
Jean-Marc Hasenfratz, Cyrille Damez, Franço...
IPCO
2007
98views Optimization» more  IPCO 2007»
13 years 9 months ago
Scheduling with Precedence Constraints of Low Fractional Dimension
Abstract. We consider the single machine scheduling problem to minimize the average weighted completion time under precedence constrains. Improving on the various 2-approximation a...
Christoph Ambühl, Monaldo Mastrolilli, Nikola...
ICC
2007
IEEE
203views Communications» more  ICC 2007»
14 years 1 months ago
Distributed Data Aggregation Using Clustered Slepian-Wolf Coding in Wireless Sensor Networks
—Slepian-Wolf coding is a promising distributed source coding technique that can completely remove the data redundancy caused by the spatially correlated observations in wireless...
Pu Wang, Cheng Li, Jun Zheng
ICIP
2005
IEEE
14 years 9 months ago
An efficient algorithm for informed embedding of dirty-paper trellis codes for watermarking
Dirty paper trellis codes are a form of watermarking with side information. These codes have the advantage of being invariant to valumetric scaling of the cover Work. However, the...
Gwenaël J. Doërr, Ingemar J. Cox, Lin Li...