Sciweavers

244 search results - page 24 / 49
» Fast Set Intersection in Memory
Sort
View
VRST
1997
ACM
14 years 2 months ago
View volume culling using a probabilistic caching scheme
This paper describes a new algorithm for view volume culling. During an interactive walkthrough of a 3D scene, at any moment a large proportion of objects will be outside of the v...
Mel Slater, Yiorgos Chrysanthou
ACSC
2007
IEEE
14 years 2 months ago
Segmentation and Border Identification of Cells in Images of Peripheral Blood Smear Slides
We present an unsupervised blood cell segmentation algorithm for images taken from peripheral blood smear slides. Unlike prior algorithms the method is fast; fully automated; find...
Nicola Ritter, James R. Cooper
SGP
2003
13 years 11 months ago
3D Reconstruction Using Labeled Image Regions
In this paper we present a novel algorithm for reconstructing 3D scenes from a set of images. The user defines a set of polygonal regions with corresponding labels in each image ...
Remo Ziegler, Wojciech Matusik, Hanspeter Pfister,...
BMCBI
2010
88views more  BMCBI 2010»
13 years 10 months ago
FastTagger: an efficient algorithm for genome-wide tag SNP selection using multi-marker linkage disequilibrium
Background: Human genome contains millions of common single nucleotide polymorphisms (SNPs) and these SNPs play an important role in understanding the association between genetic ...
Guimei Liu, Yue Wang, Limsoon Wong
KDD
2009
ACM
611views Data Mining» more  KDD 2009»
14 years 10 months ago
Fast approximate spectral clustering
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
Donghui Yan, Ling Huang, Michael I. Jordan