Sciweavers

4797 search results - page 48 / 960
» The complexity of partition tasks
Sort
View
EGPGV
2004
Springer
165views Visualization» more  EGPGV 2004»
14 years 2 months ago
Tuning of Algorithms for Independent Task Placement in the Context of Demand-Driven Parallel Ray Tracing
This paper investigates assignment strategies (load balancing algorithms) for process farms which solve the problem of online placement of a constant number of independent tasks w...
Tomas Plachetka
HPCC
2007
Springer
14 years 3 months ago
Towards a Complexity Model for Design and Analysis of PGAS-Based Algorithms
Many new Partitioned Global Address Space (PGAS) programming languages have recently emerged and are becoming ubiquitously available on nearly all modern parallel architectures. PG...
Mohamed Bakhouya, Jaafar Gaber, Tarek A. El-Ghazaw...
APLAS
2008
ACM
13 years 11 months ago
The Complexity of Coverage
Abstract. We study the problem of generating a test sequence that achieves maximal coverage for a reactive system under test. We formulate the problem as a repeated game between th...
Krishnendu Chatterjee, Luca de Alfaro, Rupak Majum...
SIGMOD
2011
ACM
442views Database» more  SIGMOD 2011»
12 years 11 months ago
ArrayStore: a storage manager for complex parallel array processing
We present the design, implementation, and evaluation of ArrayStore, a new storage manager for complex, parallel array processing. ArrayStore builds on prior work in the area of m...
Emad Soroush, Magdalena Balazinska, Daniel L. Wang
ICDM
2009
IEEE
150views Data Mining» more  ICDM 2009»
13 years 6 months ago
Filtering and Refinement: A Two-Stage Approach for Efficient and Effective Anomaly Detection
Anomaly detection is an important data mining task. Most existing methods treat anomalies as inconsistencies and spend the majority amount of time on modeling normal instances. A r...
Xiao Yu, Lu An Tang, Jiawei Han