Sciweavers

324 search results - page 17 / 65
» Bounds for Functions of Dependent Risks
Sort
View
ICCAD
2010
IEEE
140views Hardware» more  ICCAD 2010»
14 years 9 months ago
Reduction of interpolants for logic synthesis
Craig Interpolation is a state-of-the-art technique for logic synthesis and verification, based on Boolean Satisfiability (SAT). Leveraging the efficacy of SAT algorithms, Craig In...
John D. Backes, Marc D. Riedel
JMLR
2010
143views more  JMLR 2010»
14 years 10 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, ...
CORR
2010
Springer
134views Education» more  CORR 2010»
14 years 12 months ago
Large Margin Multiclass Gaussian Classification with Differential Privacy
As increasing amounts of sensitive personal information is aggregated into data repositories, it has become important to develop mechanisms for processing the data without revealin...
Manas A. Pathak, Bhiksha Raj
COCOON
2005
Springer
15 years 5 months ago
Randomized Quicksort and the Entropy of the Random Source
Abstract. The worst-case complexity of an implementation of Quicksort depends on the random number generator that is used to select the pivot elements. In this paper we estimate th...
Beatrice List, Markus Maucher, Uwe Schöning, ...
AAAI
2007
15 years 2 months ago
On the Value of Good Advice: The Complexity of A* Search with Accurate Heuristics
We study the behavior of the classical A∗ search algorithm when coupled with a heuristic that provides estimates, accurate to within a small multiplicative factor, of the distan...
Hang T. Dinh, Alexander Russell, Yuan Su