Sciweavers

126 search results - page 9 / 26
» Error bounds for correlation clustering
Sort
View
SIGGRAPH
1994
ACM
15 years 3 months ago
A clustering algorithm for radiosity in complex environments
We present an approach for accelerating hierarchical radiosity by clustering objects. Previous approaches constructed effective hierarchies by subdividing surfaces, but could not ...
Brian E. Smits, James Arvo, Donald P. Greenberg
TIT
2002
126views more  TIT 2002»
14 years 10 months ago
Two-dimensional interleaving schemes with repetitions: Constructions and bounds
Abstract--Two-dimensional interleaving schemes with repetitions are considered. These schemes are required for the correction of two-dimensional bursts (or clusters) of errors in a...
Tuvi Etzion, Alexander Vardy
COCO
2007
Springer
108views Algorithms» more  COCO 2007»
15 years 5 months ago
The Communication Complexity of Correlation
We examine the communication required for generating random variables remotely. One party Alice will be given a distribution D, and she has to send a message to Bob, who is then r...
Prahladh Harsha, Rahul Jain, David A. McAllester, ...
NIPS
2008
15 years 19 days ago
Spectral Clustering with Perturbed Data
Spectral clustering is useful for a wide-ranging set of applications in areas such as biological data analysis, image processing and data mining. However, the computational and/or...
Ling Huang, Donghui Yan, Michael I. Jordan, Nina T...
IJAR
2006
125views more  IJAR 2006»
14 years 11 months ago
Computing best-possible bounds for the distribution of a sum of several variables is NP-hard
In many real-life situations, we know the probability distribution of two random variables x1 and x2, but we have no information about the correlation between x1 and x2; what are ...
Vladik Kreinovich, Scott Ferson