Sciweavers

226 search results - page 35 / 46
» Approximate Clustering on Distributed Data Streams
Sort
View
PG
2007
IEEE
14 years 2 months ago
Precomputed Visibility Cuts for Interactive Relighting with Dynamic BRDFs
This paper presents a novel PRT-based method that uses precomputed visibility cuts for interactive relighting with all-frequency environment maps and arbitrary dynamic BRDFs. Our ...
Oskar Åkerlund, Mattias Unger, Rui Wang
SIGIR
2004
ACM
14 years 1 months ago
GaP: a factor model for discrete data
We present a probabilistic model for a document corpus that combines many of the desirable features of previous models. The model is called “GaP” for Gamma-Poisson, the distri...
John F. Canny
CLUSTER
2004
IEEE
13 years 11 months ago
XChange: coupling parallel applications in a dynamic environment
Modern computational science applications are becoming increasingly multi-disciplinaty involving widely distributed research teams and their underlying computational platforms. A ...
Hasan Abbasi, Matthew Wolf, Karsten Schwan, Greg E...
CSB
2005
IEEE
139views Bioinformatics» more  CSB 2005»
14 years 1 months ago
Using Parallel Algorithms for Searching Molecular Sequence Databases
This work presents the development of algorithms for approximate string matching using parallel methods. It intends to do the maximum of molecular sequences comparisons per unity ...
Carla Correa Tavares dos Reis, Rubem P. Mondaini
CSDA
2010
208views more  CSDA 2010»
13 years 7 months ago
Bayesian density estimation and model selection using nonparametric hierarchical mixtures
We consider mixtures of parametric densities on the positive reals with a normalized generalized gamma process (Brix, 1999) as mixing measure. This class of mixtures encompasses t...
Raffaele Argiento, Alessandra Guglielmi, Antonio P...