Sciweavers

135 search results - page 19 / 27
» Improved dense multivariate polynomial factorization algorit...
Sort
View
SODA
2010
ACM
214views Algorithms» more  SODA 2010»
15 years 9 months ago
Amplified Hardness of Approximation for VCG-Based Mechanisms
If a two-player social welfare maximization problem does not admit a PTAS, we prove that any maximal-in-range truthful mechanism that runs in polynomial time cannot achieve an app...
Shaddin Dughmi, Hu Fu, Robert Kleinberg
DICTA
2003
15 years 1 months ago
Algebraic Curve Fitting Support Vector Machines
An algebraic curve is defined as the zero set of a multivariate polynomial. We consider the problem of fitting an algebraic curve to a set of vectors given an additional set of v...
Christian J. Walder, Brian C. Lovell, Peter J. Koo...
AI
2010
Springer
14 years 11 months ago
Understanding the scalability of Bayesian network inference using clique tree growth curves
Bayesian networks (BNs) are used to represent and ef ciently compute with multi-variate probability distributions in a wide range of disciplines. One of the main approaches to per...
Ole J. Mengshoel
MFCS
2007
Springer
15 years 5 months ago
On Approximation of Bookmark Assignments
Consider a rooted directed acyclic graph G = (V, E) with root r, representing a collection V of web pages connected via a set E of hyperlinks. Each node v is associated with the pr...
Yuichi Asahiro, Eiji Miyano, Toshihide Murata, Hir...
ICALP
2010
Springer
15 years 1 months ago
Covering and Packing in Linear Space
Abstract. Given a family of subsets of an n-element universe, the kcover problem asks whether there are k sets in the family whose union contains the universe; in the k-packing pro...
Andreas Björklund, Thore Husfeldt, Petteri Ka...