Sciweavers

4908 search results - page 608 / 982
» On the Complexity of Optimal K-Anonymity
Sort
View
TE
2010
104views more  TE 2010»
15 years 1 months ago
Integrating Asynchronous Digital Design Into the Computer Engineering Curriculum
Abstract--As demand increases for circuits with higher performance, higher complexity, and decreased feature size, asynchronous (clockless) paradigms will become more widely used i...
Scott C. Smith, Waleed Al-Assadi, Jia Di
TIT
2010
153views Education» more  TIT 2010»
15 years 1 months ago
On the information rates of the plenoptic function
The plenoptic function (Adelson and Bergen, 91) describes the visual information available to an observer at any point in space and time. Samples of the plenoptic function (POF) a...
Arthur L. da Cunha, Minh N. Do, Martin Vetterli
TMM
2010
149views Management» more  TMM 2010»
15 years 1 months ago
Joint Compressive Video Coding and Analysis
Traditionally, video acquisition, coding and analysis have been designed and optimized as independent tasks. This has a negative impact in terms of consumed resources, as most of ...
M. Cossalter, Giuseppe Valenzise, Marco Tagliasacc...
TON
2010
210views more  TON 2010»
15 years 1 months ago
A New Approach to Optical Networks Security: Attack-Aware Routing and Wavelength Assignment
Abstract-- Security issues and attack management in transparent WDM (Wavelength Division Multiplexing) optical networks has become of prime importance to network operators due to t...
Nina Skorin-Kapov, J. Chen, Lena Wosinska
TSP
2010
15 years 1 months ago
Distributed sparse linear regression
The Lasso is a popular technique for joint estimation and continuous variable selection, especially well-suited for sparse and possibly under-determined linear regression problems....
Gonzalo Mateos, Juan Andrés Bazerque, Georg...