Sciweavers

7978 search results - page 778 / 1596
» Combining shared-coin algorithms
Sort
View
AFRIGRAPH
2009
ACM
15 years 11 months ago
Using an implicit min/max KD-tree for doing efficient terrain line of sight calculations
The generation of accurate Line of Sight (LOS) visibility information consumes significant resources in large scale synthetic environments such as many-on-many serious games and b...
Bernardt Duvenhage
PKDD
2000
Springer
144views Data Mining» more  PKDD 2000»
15 years 11 months ago
Fast Hierarchical Clustering Based on Compressed Data and OPTICS
: One way to scale up clustering algorithms is to squash the data by some intelligent compression technique and cluster only the compressed data records. Such compressed data recor...
Markus M. Breunig, Hans-Peter Kriegel, Jörg S...
SIGGRAPH
1995
ACM
15 years 11 months ago
A signal processing approach to fair surface design
In this paper we describe a new tool for interactive free-form fair surface design. By generalizing classical discrete Fourier analysis to two-dimensional discrete surface signals...
Gabriel Taubin
BMCBI
2008
141views more  BMCBI 2008»
15 years 7 months ago
The development of PIPA: an integrated and automated pipeline for genome-wide protein function annotation
Background: Automated protein function prediction methods are needed to keep pace with high-throughput sequencing. With the existence of many programs and databases for inferring ...
Chenggang Yu, Nela Zavaljevski, Valmik Desai, Seth...
BMCBI
2005
162views more  BMCBI 2005»
15 years 7 months ago
Accelerated probabilistic inference of RNA structure evolution
Background: Pairwise stochastic context-free grammars (Pair SCFGs) are powerful tools for evolutionary analysis of RNA, including simultaneous RNA sequence alignment and secondary...
Ian Holmes