Results 1  10
of
14,302
Topological Map for Binary Data
, 2000
"... We propose a new algorithm using topological map on binary data. ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
We propose a new algorithm using topological map on binary data.
On clustering binary data
 Proceedings of the 2005 SIAM International Conference On Data Mining(SDM’05
, 2005
"... Clustering is the problem of identifying the distribution of patterns and intrinsic correlations in large data sets by partitioning the data points into similarity classes. This paper studies the problem of clustering binary data. This is the case for market basket datasets where the transactions co ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
Clustering is the problem of identifying the distribution of patterns and intrinsic correlations in large data sets by partitioning the data points into similarity classes. This paper studies the problem of clustering binary data. This is the case for market basket datasets where the transactions
Model Selection Through Sparse Maximum Likelihood Estimation for Multivariate Gaussian or Binary Data
 JOURNAL OF MACHINE LEARNING RESEARCH
, 2008
"... We consider the problem of estimating the parameters of a Gaussian or binary distribution in such a way that the resulting undirected graphical model is sparse. Our approach is to solve a maximum likelihood problem with an added ℓ1norm penalty term. The problem as formulated is convex but the memor ..."
Abstract

Cited by 334 (2 self)
 Add to MetaCart
and Jordan, 2006), we show that these same algorithms can be used to solve an approximate sparse maximum likelihood problem for the binary case. We test our algorithms on synthetic data, as well as on gene expression and senate voting records data.
SIMILARITY OF BINARY DATA1
"... Similarity of binary data. Syst. Zool. 25:251259.—A set of intuitively obvious properties of a coefficient of similarity for binary data is established. Critical examination of the coefficients available from the literature shows that none of them satisfies all these properties, and a new coeffici ..."
Abstract
 Add to MetaCart
Similarity of binary data. Syst. Zool. 25:251259.—A set of intuitively obvious properties of a coefficient of similarity for binary data is established. Critical examination of the coefficients available from the literature shows that none of them satisfies all these properties, and a new
Fast Heterogeneous Binary Data Interchange
 IN PROCEEDINGS OF THE HETEROGENEOUS COMPUTING WORKSHOP (HCW2000
, 2000
"... As distributed applications have become more widely used, they often need to leverage the computing power of a heterogeneous network of computer architectures. Modern communications libraries provide mechanisms that hide at least some of the complexities of binary data interchange among heterogen ..."
Abstract

Cited by 28 (14 self)
 Add to MetaCart
As distributed applications have become more widely used, they often need to leverage the computing power of a heterogeneous network of computer architectures. Modern communications libraries provide mechanisms that hide at least some of the complexities of binary data interchange among
Rendering of Surfaces from Volume Data
 IEEE COMPUTER GRAPHICS AND APPLICATIONS
, 1988
"... The application of volume rendering techniques to the display of surfaces from sampled scalar functions of three spatial dimensions is explored. Fitting of geometric primitives to the sampled data is not required. Images are formed by directly shading each sample and projecting it onto the picture ..."
Abstract

Cited by 875 (12 self)
 Add to MetaCart
The application of volume rendering techniques to the display of surfaces from sampled scalar functions of three spatial dimensions is explored. Fitting of geometric primitives to the sampled data is not required. Images are formed by directly shading each sample and projecting it onto
Selfadjusting binary search trees
, 1985
"... The splay tree, a selfadjusting form of binary search tree, is developed and analyzed. The binary search tree is a data structure for representing tables and lists so that accessing, inserting, and deleting items is easy. On an nnode splay tree, all the standard search tree operations have an am ..."
Abstract

Cited by 432 (18 self)
 Add to MetaCart
The splay tree, a selfadjusting form of binary search tree, is developed and analyzed. The binary search tree is a data structure for representing tables and lists so that accessing, inserting, and deleting items is easy. On an nnode splay tree, all the standard search tree operations have
Eraser: a dynamic data race detector for multithreaded programs
 ACM Transaction of Computer System
, 1997
"... Multithreaded programming is difficult and error prone. It is easy to make a mistake in synchronization that produces a data race, yet it can be extremely hard to locate this mistake during debugging. This paper describes a new tool, called Eraser, for dynamically detecting data races in lockbased ..."
Abstract

Cited by 688 (2 self)
 Add to MetaCart
Multithreaded programming is difficult and error prone. It is easy to make a mistake in synchronization that produces a data race, yet it can be extremely hard to locate this mistake during debugging. This paper describes a new tool, called Eraser, for dynamically detecting data races in lock
Results 1  10
of
14,302