Sciweavers

1464 search results - page 50 / 293
» On optimal anonymization for l -diversity
Sort
View
JMLR
2010
143views more  JMLR 2010»
15 years 4 months ago
A Quasi-Newton Approach to Nonsmooth Convex Optimization Problems in Machine Learning
We extend the well-known BFGS quasi-Newton method and its memory-limited variant LBFGS to the optimization of nonsmooth convex objectives. This is done in a rigorous fashion by ge...
Jin Yu, S. V. N. Vishwanathan, Simon Günter, ...
INFOCOM
2005
IEEE
15 years 11 months ago
Power control for OSNR optimization in optical networks: a distributed algorithm via a central cost approach
— This paper addresses the problem of optical signal-to-noise ratio (OSNR) optimization in optical networks. An analytical OSNR network model is developed for a general multi-lin...
L. Pavel
FCCM
2004
IEEE
98views VLSI» more  FCCM 2004»
15 years 10 months ago
Automated Least-Significant Bit Datapath Optimization for FPGAs
In this paper we present a method for FPGA datapath precision optimization subject to user-defined area and error constraints. This work builds upon our previous research [1] which...
Mark L. Chang, Scott Hauck
GLOBECOM
2010
IEEE
15 years 4 months ago
Information Theoretic Optimal Broadband Matching for Communication Systems
We present an information theoretic perspective on optimal broadband matching. Most of the broadband matching and communication theory literature assumes a frequencyflat reflection...
Pawandeep S. Taluja, Brian L. Hughes
TACS
1997
Springer
15 years 10 months ago
Optimal Representations of Polymorphic Types with Subtyping (Extended Abstract)
d Abstract) Alexander Aiken1 and Edward L. Wimmers2 and Jens Palsberg3 1 EECS Department, University of California at Berkeley, Berkeley, CA 94720-1776. 2 IBM Almaden Research Cent...
Alexander Aiken, Edward L. Wimmers, Jens Palsberg