Sciweavers

32545 search results - page 635 / 6509
» Data Structures and Algorithms
Sort
View
VRST
1997
ACM
15 years 11 months ago
An efficient collision detection algorithm using range data for walk-through systems
We present a simple, but efficient view collision detection method for the walk-through system. The basic idea is to check if the current view position intersects with the range d...
SonOu Lee, JunHyeok Heo, KwangYun Wohn
IDA
2011
Springer
15 years 2 months ago
A parallel, distributed algorithm for relational frequent pattern discovery from very large data sets
The amount of data produced by ubiquitous computing applications is quickly growing, due to the pervasive presence of small devices endowed with sensing, computing and communicatio...
Annalisa Appice, Michelangelo Ceci, Antonio Turi, ...
PODS
2008
ACM
159views Database» more  PODS 2008»
16 years 7 months ago
Approximation algorithms for clustering uncertain data
There is an increasing quantity of data with uncertainty arising from applications such as sensor network measurements, record linkage, and as output of mining algorithms. This un...
Graham Cormode, Andrew McGregor
BMCBI
2008
146views more  BMCBI 2008»
15 years 7 months ago
A phase synchronization clustering algorithm for identifying interesting groups of genes from cell cycle expression data
Background: The previous studies of genome-wide expression patterns show that a certain percentage of genes are cell cycle regulated. The expression data has been analyzed in a nu...
Chang Sik Kim, Cheol Soo Bae, Hong Joon Tcha
ISCA
1998
IEEE
135views Hardware» more  ISCA 1998»
15 years 11 months ago
Branch Prediction Based on Universal Data Compression Algorithms
Data compression and prediction are closely related. Thus prediction methods based on data compression algorithms have been suggested for the branch prediction problem. In this wo...
Eitan Federovsky, Meir Feder, Shlomo Weiss