Sciweavers

784 search results - page 142 / 157
» Relaxing the Value Restriction
Sort
View
CONSTRAINTS
2010
116views more  CONSTRAINTS 2010»
13 years 9 months ago
Erratum to "Reformulating table constraints using functional dependencies - an application to explanation generation"
Abstract. We had claimed that arc-consistency is preserved in a constraint reformulation relying on functional dependencies (Theorem 2 of [2]). We show that the statement of this t...
Hadrien Cambazard, Barry O'Sullivan
JSC
2006
52views more  JSC 2006»
13 years 9 months ago
Markov bases of three-way tables are arbitrarily complicated
We show the following two universality statements on the entry-ranges and Markov bases of spaces of 3-way contingency tables with fixed 2-margins: (1) For any finite set D of nonn...
Jesús A. De Loera, Shmuel Onn
TMC
2008
127views more  TMC 2008»
13 years 8 months ago
Time and Energy Complexity of Distributed Computation of a Class of Functions in Wireless Sensor Networks
We consider a scenario in which a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing a...
Nilesh Khude, Anurag Kumar, Aditya Karnik
MST
2007
167views more  MST 2007»
13 years 8 months ago
The Complexity of Polynomial-Time Approximation
In 1996, Khanna and Motwani [KM96] proposed three logic-based optimization problems constrained by planar structure, and offered the hypothesis that these putatively fundamental ...
Liming Cai, Michael R. Fellows, David W. Juedes, F...
SIAMSC
2010
215views more  SIAMSC 2010»
13 years 7 months ago
A Fast Algorithm for Sparse Reconstruction Based on Shrinkage, Subspace Optimization, and Continuation
We propose a fast algorithm for solving the ℓ1-regularized minimization problem minx∈Rn µ x 1 + Ax − b 2 2 for recovering sparse solutions to an undetermined system of linea...
Zaiwen Wen, Wotao Yin, Donald Goldfarb, Yin Zhang