Sciweavers

162 search results - page 12 / 33
» Study of Lower Bound Functions for MAX-2-SAT
Sort
View
FOCS
2006
IEEE
15 years 3 months ago
Improved Bounds for Online Routing and Packing Via a Primal-Dual Approach
In this work we study a wide range of online and offline routing and packing problems with various objectives. We provide a unified approach, based on a clean primal-dual method...
Niv Buchbinder, Joseph Naor
ML
2012
ACM
385views Machine Learning» more  ML 2012»
13 years 5 months ago
An alternative view of variational Bayes and asymptotic approximations of free energy
Bayesian learning, widely used in many applied data-modeling problems, is often accomplished with approximation schemes because it requires intractable computation of the posterio...
Kazuho Watanabe
DM
2000
76views more  DM 2000»
14 years 9 months ago
On the number of ordered factorizations of natural numbers
We study the number of ways to factor a natural number n into an ordered product of integers, each factor greater than one, denoted by H(n). This counting function from number the...
Benny Chor, Paul Lemke, Ziv Mador
WADS
2005
Springer
95views Algorithms» more  WADS 2005»
15 years 3 months ago
Improved Approximation Bounds for Planar Point Pattern Matching
We analyze the performance of simple algorithms for matching two planar point sets under rigid transformations so as to minimize the directed Hausdorff distance between the sets....
Minkyoung Cho, David M. Mount
FOCS
2005
IEEE
15 years 3 months ago
The Complexity of Online Memory Checking
We consider the problem of storing a large file on a remote and unreliable server. To verify that the file has not been corrupted, a user could store a small private (randomized...
Moni Naor, Guy N. Rothblum