Sciweavers

1688 search results - page 193 / 338
» The Complexity of Rationalizing Matchings
Sort
View
CVPR
2011
IEEE
14 years 6 months ago
Feature Guided Motion Artifact Reduction with Structure-Awareness in 4D CT Images
In this paper, we propose a novel method to reduce the magnitude of 4D CT artifacts by stitching two images with a data-driven regularization constrain, which helps preserve the l...
Dongfeng Han, John Bayouth, Qi Song, sudershan Bha...
TCOM
2010
65views more  TCOM 2010»
14 years 6 months ago
Max-matching diversity in OFDMA systems
Abstract--This paper considers the problem of optimal subcarrier allocation in OFDMA systems to achieve the minimum outage probability while guaranteeing fairness. The optimal subc...
Bo Bai, Wei Chen, Zhigang Cao, Khaled Ben Letaief
ICDE
2011
IEEE
263views Database» more  ICDE 2011»
14 years 3 months ago
Adding regular expressions to graph reachability and pattern queries
—It is increasingly common to find graphs in which edges bear different types, indicating a variety of relationships. For such graphs we propose a class of reachability queries ...
Wenfei Fan, Jianzhong Li, Shuai Ma, Nan Tang, Ying...
ASIACRYPT
2011
Springer
13 years 11 months ago
Cryptanalysis of ARMADILLO2
ARMADILLO2 is the recommended variant of a multi-purpose cryptographic primitive dedicated to hardware which has been proposed by Badel et al. in [1]. In this paper we propose a me...
Mohamed Ahmed Abdelraheem, Céline Blondeau,...
INFOCOM
2005
IEEE
15 years 5 months ago
Practical algorithms for performance guarantees in buffered crossbars
— This paper is about high capacity switches and routers that give guaranteed throughput, rate and delay guarantees. Many routers are built using input queueing or combined input...
Shang-Tse Chuang, Sundar Iyer, Nick McKeown