Sciweavers

376 search results - page 58 / 76
» Approximating Probability Distributions Using Small Sample S...
Sort
View
KDD
2008
ACM
165views Data Mining» more  KDD 2008»
14 years 8 months ago
Colibri: fast mining of large static and dynamic graphs
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...
Hanghang Tong, Spiros Papadimitriou, Jimeng Sun, P...
INFOCOM
2010
IEEE
13 years 6 months ago
Topology Control for Effective Interference Cancellation in Multi-User MIMO Networks
—In Multi-User MIMO networks, receivers decode multiple concurrent signals using Successive Interference Cancellation (SIC). With SIC a weak target signal can be deciphered in th...
Ece Gelal, Konstantinos Pelechrinis, Tae-Suk Kim, ...
ISBI
2004
IEEE
14 years 8 months ago
A Method for Reconstructing Label Images From a Few Projections, as Motivated by Electron Microscopy
Our aim is to produce a tessellation of space into small voxels and, based on only a few tomographic projections of an object, assign to each voxel a label that indicates one of t...
Hstau Y. Liao, Gabor T. Herman
ESANN
2006
13 years 9 months ago
Data topology visualization for the Self-Organizing Map
The Self-Organizing map (SOM), a powerful method for data mining and cluster extraction, is very useful for processing data of high dimensionality and complexity. Visualization met...
Kadim Tasdemir, Erzsébet Merényi
ICML
2007
IEEE
14 years 8 months ago
Efficiently computing minimax expected-size confidence regions
Given observed data and a collection of parameterized candidate models, a 1- confidence region in parameter space provides useful insight as to those models which are a good fit t...
Brent Bryan, H. Brendan McMahan, Chad M. Schafer, ...