Sciweavers

7106 search results - page 771 / 1422
» Restricted Complexity, General Complexity
Sort
View
202
Voted
KDD
2006
ACM
113views Data Mining» more  KDD 2006»
16 years 7 months ago
A new efficient probabilistic model for mining labeled ordered trees
Mining frequent patterns is a general and important issue in data mining. Complex and unstructured (or semi-structured) datasets have appeared in major data mining applications, i...
Kosuke Hashimoto, Kiyoko F. Aoki-Kinoshita, Nobuhi...
CHI
2007
ACM
16 years 7 months ago
Meta-analysis of correlations among usability measures
Understanding the relation between usability measures seems crucial to deepen our conception of usability and to select the right measures for usability studies. We present a meta...
Kasper Hornbæk, Effie Lai-Chong Law
POPL
2003
ACM
16 years 7 months ago
Discovering affine equalities using random interpretation
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...
Sumit Gulwani, George C. Necula
199
Voted
SIGMOD
2005
ACM
77views Database» more  SIGMOD 2005»
16 years 7 months ago
On Joining and Caching Stochastic Streams
We consider the problem of joining data streams using limited cache memory, with the goal of producing as many result tuples as possible from the cache. Many cache replacement heu...
Jun Yang 0001, Junyi Xie, Yuguo Chen
ICFP
2008
ACM
16 years 7 months ago
A scheduling framework for general-purpose parallel languages
The trend in microprocessor design toward multicore and manycore processors means that future performance gains in software will largely come from harnessing parallelism. To reali...
Matthew Fluet, Mike Rainey, John H. Reppy