Sciweavers

4908 search results - page 202 / 982
» On the Complexity of Optimal K-Anonymity
Sort
View
ECCV
2010
Springer
15 years 7 months ago
Fast Optimization for Mixture Prior Models
Abstract. We consider the minimization of a smooth convex function regularized by the mixture of prior models. This problem is generally difficult to solve even each simpler regula...
Junzhou Huang, Shaoting Zhang, Dimitris N. Metaxas
AINA
2007
IEEE
15 years 6 months ago
Optimizing Performance of Web Service Providers
A workflow aggregates the underlying Web Services in a manner consistent with the desired functionality. Since CWS can contain atomic and other CWS they encourage the development ...
Dmytro Dyachuk, Ralph Deters
TMI
2008
67views more  TMI 2008»
15 years 6 months ago
A Fast Method for Designing Time-Optimal Gradient Waveforms for Arbitrary k-Space Trajectories
A fast and simple algorithm for designing time-optimal waveforms is presented. The algorithm accepts a given arbitrary multi-dimensional k-space trajectory as the input and outputs...
Michael Lustig, Seung-Jean Kim, John M. Pauly
GLOBECOM
2010
IEEE
15 years 4 months ago
Diversity Embedded Streaming Erasure Codes (DE-SCo): Constructions and Optimality
Streaming erasure codes encode a source stream to guarantee that each source packet is recovered within a fixed delay at the receiver over a burst-erasure channel. This paper intro...
Ahmed Badr, Ashish Khisti, Emin Martinian
TCOM
2010
97views more  TCOM 2010»
15 years 1 months ago
Linear Non-Regenerative Multicarrier MIMO Relay Communications Based on MMSE Criterion
In this letter we propose linear non-regenerative multicarrier multiple-input multiple-output (MIMO) relay technique that aims to minimize the mean-squared error (MSE) of the signa...
Yue Rong