Sciweavers

1686 search results - page 151 / 338
» Programs as polygraphs: computability and complexity
Sort
View
TCAD
2010
168views more  TCAD 2010»
15 years 1 months ago
An MILP-Based Performance Analysis Technique for Non-Preemptive Multitasking MPSoC
For real-time applications, it is necessary to estimate the worst-case performance early in the design process without actual hardware implementation. While the non-preemptive task...
Hoeseok Yang, Sungchan Kim, Soonhoi Ha
ICASSP
2011
IEEE
14 years 10 months ago
Cheap semidefinite relaxation MIMO detection using row-by-row block coordinate descent
This paper considers the problem of low complexity implementation of high-performance semidefinite relaxation (SDR) MIMO detection methods. Currently, most SDR MIMO detectors are...
Hoi-To Wai, Wing-Kin Ma, Anthony Man-Cho So
ICDCS
2011
IEEE
14 years 6 months ago
YSmart: Yet Another SQL-to-MapReduce Translator
— MapReduce has become an effective approach to big data analytics in large cluster systems, where SQL-like queries play important roles to interface between users and systems. H...
Rubao Lee, Tian Luo, Yin Huai, Fusheng Wang, Yongq...
CVPR
2008
IEEE
16 years 1 months ago
Fast kernel learning for spatial pyramid matching
Spatial pyramid matching (SPM) is a simple yet effective approach to compute similarity between images. Similarity kernels at different regions and scales are usually fused by som...
Junfeng He, Shih-Fu Chang, Lexing Xie
HPDC
2002
IEEE
15 years 11 months ago
Interactive and Descriptor-Based Deployment of Object-Oriented Grid Applications
Increasing complexity of distributed applications and commodity of resources through grids are making the tasks of deploying those applications harder. There is a clear need for s...
Françoise Baude, Denis Caromel, Fabrice Hue...