Sciweavers

4539 search results - page 409 / 908
» Approaches to Compute Workflow Complexity
Sort
View
DAC
2008
ACM
16 years 7 months ago
Automated hardware-independent scenario identification
Scenario-based design exploits the time-varying execution behavior of applications by dynamically adapting the system on which they run. This is a particularly interesting design ...
Juan Hamers, Lieven Eeckhout
ICIP
2005
IEEE
16 years 8 months ago
Embedded image coding with context partitioning and quantization
As a key part of universal source coding, context quantization is very important for improving compression performance. However, in most existing methods, the quantizer is trained...
Hua Cai, Xing San, Jiang Li
WWW
2004
ACM
16 years 7 months ago
Matching web site structure and content
To keep an overview of a complex corporate web sites, it is crucial to understand the relationship of contents, structure and the user's behavior. In this paper, we describe ...
Vassil Gedov, Carsten Stolz, Ralph Neuneier, Micha...
ICDM
2009
IEEE
117views Data Mining» more  ICDM 2009»
16 years 1 months ago
Redistricting Using Heuristic-Based Polygonal Clustering
— Redistricting is the process of dividing a geographic area into districts or zones. This process has been considered in the past as a problem that is computationally too comple...
Deepti Joshi, Leen-Kiat Soh, Ashok Samal
ICC
2007
IEEE
160views Communications» more  ICC 2007»
16 years 1 months ago
Differential Bell-Labs Layered Space Time Architectures
Abstract—Most research on differential MIMO is based on spacetime block codes, aiming to achieve maximum transmit diversity and thus make the transmission more robust by the aid ...
Lingyang Song, Alister G. Burr, Rodrigo C. de Lama...