Sciweavers

1670 search results - page 62 / 334
» Fast Computation of Data Correlation Using BDDs
Sort
View
INFOCOM
2002
IEEE
15 years 7 months ago
Fast PDA Synchronization Using Characteristic Polynomial Interpolation
—Modern Personal Digital Assistant (PDA) architectures often utilize a wholesale data transfer protocol known as “slow sync” for synchronizing PDAs with Personal Computers (P...
Ari Trachtenberg, David Starobinski, Sachin Agarwa...
ISVC
2007
Springer
15 years 8 months ago
Fast kd -Tree Construction for 3D-Rendering Algorithms Like Ray Tracing
Many computer graphics rendering algorithms and techniques use ray tracing for generation of natural and photo-realistic images. The efficiency of the ray tracing algorithms depend...
Sajid Hussain, Håkan Grahn
112
Voted
COMPGEOM
2006
ACM
15 years 8 months ago
A fast k-means implementation using coresets
In this paper we develop an efficient implementation for a k-means clustering algorithm. The novel feature of our algorithm is that it uses coresets to speed up the algorithm. A ...
Gereon Frahling, Christian Sohler
120
Voted
MONET
2007
95views more  MONET 2007»
15 years 2 months ago
A Pervasive Computing System for the Operating Room of the Future
We describe a prototype Context Aware Perioperative Information System to capture and interpret data in an operating room of the future. The captured data is used to construct the...
Sheetal K. Agarwal, Anupam Joshi, Timothy W. Finin...
146
Voted
BMCBI
2008
132views more  BMCBI 2008»
15 years 2 months ago
Computational cluster validation for microarray data analysis: experimental assessment of Clest, Consensus Clustering, Figure of
Background: Inferring cluster structure in microarray datasets is a fundamental task for the so-called -omic sciences. It is also a fundamental question in Statistics, Data Analys...
Raffaele Giancarlo, Davide Scaturro, Filippo Utro