Sciweavers

515 search results - page 99 / 103
» A Reduced Complexity Algorithm for Minimizing N-Detect Tests
Sort
View
CVPR
2007
IEEE
14 years 1 months ago
Hierarchical Structuring of Data on Manifolds
Manifold learning methods are promising data analysis tools. However, if we locate a new test sample on the manifold, we have to find its embedding by making use of the learned e...
Jun Li, Pengwei Hao
ICCAD
1999
IEEE
148views Hardware» more  ICCAD 1999»
13 years 11 months ago
SAT based ATPG using fast justification and propagation in the implication graph
In this paper we present new methods for fast justification and propagation in the implication graph (IG) which is the core data structure of our SAT based implication engine. As ...
Paul Tafertshofer, Andreas Ganz
SIGGRAPH
1998
ACM
13 years 11 months ago
Progressive Forest Split Compression
In this paper we introduce the Progressive Forest Split (PFS) representation, a new adaptive refinement scheme for storing and transmitting manifold triangular meshes in progress...
Gabriel Taubin, André Guéziec, Willi...
BMCBI
2010
133views more  BMCBI 2010»
13 years 6 months ago
New components of the Dictyostelium PKA pathway revealed by Bayesian analysis of expression data
Background: Identifying candidate genes in genetic networks is important for understanding regulation and biological function. Large gene expression datasets contain relevant info...
Anup Parikh, Eryong Huang, Christopher Dinh, Blaz ...
KDD
2003
ACM
130views Data Mining» more  KDD 2003»
14 years 7 months ago
Towards systematic design of distance functions for data mining applications
Distance function computation is a key subtask in many data mining algorithms and applications. The most effective form of the distance function can only be expressed in the conte...
Charu C. Aggarwal