SAT
2007
Springer
14 years 6 months ago
2007
Springer
Abstract. We consider the problem of computing tractable approximations to CNF formulas, extending the approach of Selman and Kautz to compute the Horn-LUB to involve renaming of v...
HYBRID
2007
Springer
14 years 6 months ago
2007
Springer
We provide an asymptotically tight, computationally efficient approximation of the joint spectral radius of a set of matrices using sum of squares (SOS) programming. The approach i...
GECCO
2007
Springer
14 years 6 months ago
2007
Springer
The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, th...
FCT
2007
Springer
14 years 6 months ago
2007
Springer
We present new combinatorial approximation algorithms for k-set cover. Previous approaches are based on extending the greedy algorithm by efficiently handling small sets. The new a...
PG
2007
IEEE
14 years 6 months ago
2007
IEEE
We describe a new, analytic approximation to the airlight integral from scattering media whose density is modeled as a sum of Gaussians. The approximation supports real-time rende...
INFOCOM
2008
IEEE
14 years 6 months ago
2008
IEEE
—In a wireless network with node exclusive spectrum sharing, two popular schedules are maximum weight matching (MWM) schedule and maximum size matching (MSM) schedule. The former...
ICTAI
2008
IEEE
14 years 6 months ago
2008
IEEE
—The dynamics of many systems are described by ordinary differential equations (ODE). Solving ODEs with standard methods (i.e. numerical integration) needs a high amount of compu...
SIGECOM
2009
ACM
14 years 6 months ago
2009
ACM
The literature on algorithmic mechanism design is mostly concerned with game-theoretic versions of optimization problems to which standard economic money-based mechanisms cannot b...
FSTTCS
2009
Springer
14 years 6 months ago
2009
Springer
ABSTRACT. We study functionally private approximations. An approximation function g is functionally private with respect to f if, for any input x, g(x) reveals no more information ...
INFOCOM
2009
IEEE
14 years 6 months ago
2009
IEEE
— In this work we study the problem of determining the throughput capacity of a wireless network. We propose a scheduling algorithm to achieve this capacity within an approximati...