Sciweavers

3946 search results - page 605 / 790
» The computational complexity of choice sets
Sort
View
JCM
2008
70views more  JCM 2008»
15 years 6 months ago
Reed-Solomon Codes for Low Power Communications
Power consumption is a critical issue for many applications running on autonomous battery operated devices. In the context of low power communications, the use of Forward Error Cor...
Lionel Biard, Dominique Noguet
JUCS
2008
137views more  JUCS 2008»
15 years 6 months ago
CrossMDA: a Model-driven Approach for Aspect Management
: Nowadays, the complexity of software applications has brought new challenges to developers, having to deal with a large number of computational requirements. Among these requirem...
Marcelo Pitanga Alves, Paulo F. Pires, Fláv...
209
Voted
JSAC
2006
81views more  JSAC 2006»
15 years 6 months ago
Fast linearized energy allocation for multimedia loading on multicarrier systems
Abstract--Efficient near-optimal energy allocation for multimedia data transmission using multicarrier modulation is investigated. The optimal method typically relies on an iterati...
Michael A. Enright, C. C. Jay Kuo
PAMI
2008
147views more  PAMI 2008»
15 years 6 months ago
Image Stitching Using Structure Deformation
The aim of this paper is to achieve seamless image stitching without producing visual artifact caused by severe intensity discrepancy and structure misalignment, given that the inp...
Jiaya Jia, Chi-Keung Tang
TCS
2008
15 years 6 months ago
New constructions for provably-secure time-bound hierarchical key assignment schemes
A time-bound hierarchical key assignment scheme is a method to assign time-dependent encryption keys to a set of classes in a partially ordered hierarchy, in such a way that each ...
Alfredo De Santis, Anna Lisa Ferrara, Barbara Masu...