Sciweavers

3637 search results - page 524 / 728
» On Dynamic Bit-Probe Complexity
Sort
View
KDD
2009
ACM
207views Data Mining» more  KDD 2009»
16 years 7 months ago
DynaMMo: mining and summarization of coevolving sequences with missing values
Given multiple time sequences with missing values, we propose DynaMMo which summarizes, compresses, and finds latent variables. The idea is to discover hidden variables and learn ...
Lei Li, James McCann, Nancy S. Pollard, Christos F...
KDD
2006
ACM
115views Data Mining» more  KDD 2006»
16 years 7 months ago
Aggregating time partitions
Partitions of sequential data exist either per se or as a result of sequence segmentation algorithms. It is often the case that the same timeline is partitioned in many different ...
Evimaria Terzi, Panayiotis Tsaparas, Taneli Mielik...
CHI
2005
ACM
16 years 7 months ago
Life on the edge: supporting collaboration in location-based experiences
We study a collaborative location-based game in which groups of `lions' hunt together on a virtual savannah that is overlaid on an open playing field. The game implements a s...
Steve Benford, Duncan Rowland, Martin Flintham, Ad...
HPCA
2006
IEEE
16 years 7 months ago
CORD: cost-effective (and nearly overhead-free) order-recording and data race detection
Chip-multiprocessors are becoming the dominant vehicle for general-purpose processing, and parallel software will be needed to effectively utilize them. This parallel software is ...
Milos Prvulovic
CHI
2001
ACM
16 years 7 months ago
Accuracy measures for evaluating computer pointing devices
In view of the difficulties in evaluating computer pointing devices across different tasks within dynamic and complex systems, new performance measures are needed. This paper prop...
I. Scott MacKenzie, Tatu Kauppinen, Miika Silfverb...