Sciweavers

884 search results - page 173 / 177
» Algorithms for Implicit Deformable Models
Sort
View
KDD
2009
ACM
189views Data Mining» more  KDD 2009»
14 years 3 months ago
CoCo: coding cost for parameter-free outlier detection
How can we automatically spot all outstanding observations in a data set? This question arises in a large variety of applications, e.g. in economy, biology and medicine. Existing ...
Christian Böhm, Katrin Haegler, Nikola S. M&u...
CSB
2005
IEEE
146views Bioinformatics» more  CSB 2005»
14 years 2 months ago
Multi-Metric and Multi-Substructure Biclustering Analysis for Gene Expression Data
A good number of biclustering algorithms have been proposed for grouping gene expression data. Many of them have adopted matrix norms to define the similarity score of a bicluste...
Sun-Yuan Kung, Man-Wai Mak, Ilias Tagkopoulos
ISNN
2005
Springer
14 years 1 months ago
One-Bit-Matching ICA Theorem, Convex-Concave Programming, and Combinatorial Optimization
Recently, a mathematical proof is obtained in (Liu, Chiu, Xu, 2004) on the so called one-bit-matching conjecture that all the sources can be separated as long as there is an one-to...
Lei Xu
MIDDLEWARE
2004
Springer
14 years 1 months ago
The Peer Sampling Service: Experimental Evaluation of Unstructured Gossip-Based Implementations
In recent years, the gossip-based communication model in large-scale distributed systems has become a general paradigm with important applications which include information dissemi...
Márk Jelasity, Rachid Guerraoui, Anne-Marie...
SIGGRAPH
1993
ACM
14 years 15 days ago
Interval methods for multi-point collisions between time-dependent curved surfaces
We present an efficient and robust algorithm for finding points of collision between time-dependent parametric and implicit surfaces. The algorithm detects simultaneous collisio...
John M. Snyder, Adam R. Woodbury, Kurt W. Fleische...