Sciweavers

27 search results - page 3 / 6
» Grid Drawings of Binary Trees: An Experimental Study
Sort
View
CCGRID
2007
IEEE
14 years 5 months ago
High-Performance MPI Broadcast Algorithm for Grid Environments Utilizing Multi-lane NICs
The performance of MPI collective operations, such as broadcast and reduction, is heavily affected by network topologies, especially in grid environments. Many techniques to cons...
Tatsuhiro Chiba, Toshio Endo, Satoshi Matsuoka
LPAR
2010
Springer
13 years 9 months ago
Partitioning SAT Instances for Distributed Solving
Abstract. In this paper we study the problem of solving hard propositional satisfiability problem (SAT) instances in a computing grid or cloud, where run times and communication b...
Antti Eero Johannes Hyvärinen, Tommi A. Juntt...
AUSDM
2007
Springer
193views Data Mining» more  AUSDM 2007»
14 years 5 months ago
Are Zero-suppressed Binary Decision Diagrams Good for Mining Frequent Patterns in High Dimensional Datasets?
Mining frequent patterns such as frequent itemsets is a core operation in many important data mining tasks, such as in association rule mining. Mining frequent itemsets in high-di...
Elsa Loekito, James Bailey
WCE
2007
13 years 12 months ago
A Robust Image Watermarking Scheme Using Multiwavelet Tree
— In this paper, we attempt to develop image watermarking algorithms which are portable to a variety of applications such as copyright protection, fingerprinting and identificati...
Prayoth Kumsawat, Kitti Attakitmongcol, Arthit Sri...
UIST
2009
ACM
14 years 5 months ago
EverybodyLovesSketch: 3D sketching for a broader audience
We present EverybodyLovesSketch, a gesture-based 3D curve sketching system for rapid ideation and visualization of 3D forms, aimed at a broad audience. We first analyze traditiona...
Seok-Hyung Bae, Ravin Balakrishnan, Karan Singh