Sciweavers

1248 search results - page 209 / 250
» On the Number of Birch Partitions
Sort
View
BIOINFORMATICS
2011
13 years 1 months ago
libfbi: a C++ implementation for fast box intersection and application to sparse mass spectrometry data
Abstract. This document is a preprint of the following publication: Bioinformatics (2011) 27(8): 1166-1167. Algorithms for sparse data require fast search and subset selection capa...
Marc Kirchner, Buote Xu, Hanno Steen, Judith A. J....
3DIM
2011
IEEE
12 years 10 months ago
Visual Hull from Imprecise Polyhedral Scene
—We present a framework to compute the visual hull of a polyhedral scene, in which the vertices of the polyhedra are given with some imprecision. Two kinds of visual event surfac...
Peng He, Abbas Edalat
ETS
2011
IEEE
224views Hardware» more  ETS 2011»
12 years 9 months ago
AVF Analysis Acceleration via Hierarchical Fault Pruning
—The notion of Architectural Vulnerability Factor (AVF) has been extensively used by designers to evaluate various aspects of design robustness. While AVF is a very accurate way ...
Michail Maniatakos, Chandra Tirumurti, Abhijit Jas...
CATA
2000
13 years 11 months ago
Fast connected component labeling algorithm using a divide and conquer technique
We investigate a method to speed up the O(n3 ) labeling algorithm of Rosenfeld and Pfaltz for segmenting binary images, which is unduly complex for large images. That algorithm sea...
June-Me Park, Carl G. Looney, Hui-Chuan Chen
KDD
2003
ACM
191views Data Mining» more  KDD 2003»
14 years 10 months ago
Assessment and pruning of hierarchical model based clustering
The goal of clustering is to identify distinct groups in a dataset. The basic idea of model-based clustering is to approximate the data density by a mixture model, typically a mix...
Jeremy Tantrum, Alejandro Murua, Werner Stuetzle