Sciweavers

1293 search results - page 115 / 259
» Scalability Study of the KSR-1
Sort
View
KDD
2005
ACM
92views Data Mining» more  KDD 2005»
16 years 6 months ago
Summarizing itemset patterns: a profile-based approach
Frequent-pattern mining has been studied extensively on scalable methods for mining various kinds of patterns including itemsets, sequences, and graphs. However, the bottleneck of...
Xifeng Yan, Hong Cheng, Jiawei Han, Dong Xin
ICCAD
2007
IEEE
109views Hardware» more  ICCAD 2007»
16 years 3 months ago
Inductive equivalence checking under retiming and resynthesis
Retiming and resynthesis are among the most important techniques for practical sequential circuit optimization. However, their applicability is much limited due to verification c...
Jie-Hong Roland Jiang, Wei-Lun Hung
CHI
2010
ACM
16 years 1 months ago
Crowdsourcing graphical perception: using mechanical turk to assess visualization design
Understanding perception is critical to effective visualization design. With its low cost and scalability, crowdsourcing presents an attractive option for evaluating the large des...
Jeffrey Heer, Michael Bostock
ICDE
2009
IEEE
155views Database» more  ICDE 2009»
16 years 1 months ago
SPROUT: Lazy vs. Eager Query Plans for Tuple-Independent Probabilistic Databases
— A paramount challenge in probabilistic databases is the scalable computation of confidences of tuples in query results. This paper introduces an efficient secondary-storage o...
Dan Olteanu, Jiewen Huang, Christoph Koch
CLUSTER
2008
IEEE
16 years 27 days ago
Are nonblocking networks really needed for high-end-computing workloads?
—High-speed interconnects are frequently used to provide scalable communication on increasingly large high-end computing systems. Often, these networks are nonblocking, where the...
Narayan Desai, Pavan Balaji, P. Sadayappan, Mohamm...