Sciweavers

676 search results - page 86 / 136
» On Approximation Lower Bounds for TSP with Bounded Metrics
Sort
View
FORMATS
2009
Springer
14 years 3 months ago
Realizability of Real-Time Logics
Abstract. We study the realizability problem for specifications of reactive systems expressed in real-time linear temporal logics. The logics we consider are subsets of MITL (Metr...
Laurent Doyen, Gilles Geeraerts, Jean-Franç...
PG
2007
IEEE
14 years 3 months ago
Faceting Artifact Analysis for Computer Graphics
The faceting signal, defined in this paper as the difference signal between a rendering of the original geometric model and a simplified version of the geometric model, is respo...
Lijun Qu, Gary W. Meyer
CORR
2008
Springer
84views Education» more  CORR 2008»
13 years 8 months ago
Message-Passing Decoding of Lattices Using Gaussian Mixtures
A belief-propagation decoder for low-density lattice codes, which represents messages explicitly as a mixture of Gaussians functions, is given. In order to prevent the mixture elem...
Brian M. Kurkoski, Justin Dauwels
IPL
2002
74views more  IPL 2002»
13 years 8 months ago
Restricted rotation distance between binary trees
Restricted rotation distance between pairs of rooted binary trees measures differences in tree shape and is related to rotation distance. In restricted rotation distance, the rota...
Sean Cleary
STOC
2009
ACM
146views Algorithms» more  STOC 2009»
14 years 9 months ago
Conditional hardness for satisfiable 3-CSPs
In this paper we study a fundamental open problem in the area of probabilistic checkable proofs: What is the smallest s such that NP naPCP1,s[O(log n), 3]? In the language of har...
Ryan O'Donnell, Yi Wu