Sciweavers

256 search results - page 13 / 52
» A Unified Approach to Approximating Partial Covering Problem...
Sort
View
FOCM
2010
97views more  FOCM 2010»
13 years 6 months ago
Self-Concordant Barriers for Convex Approximations of Structured Convex Sets
We show how to approximate the feasible region of structured convex optimization problems by a family of convex sets with explicitly given and efficient (if the accuracy of the ap...
Levent Tunçel, Arkadi Nemirovski
ICPP
1993
IEEE
13 years 11 months ago
A Unified Model for Concurrent Debugging
: Events are occurrence instances of actions. The thesis of this paper is that the use of “actions”, instead of events, greatly simplifies the problem of concurrent debugging....
S. I. Hyder, John Werth, James C. Browne
ICDE
2010
IEEE
193views Database» more  ICDE 2010»
14 years 2 months ago
Schema covering: a step towards enabling reuse in information integration
Abstract—We introduce schema covering, the problem of identifying easily understandable common objects for describing large and complex schemas. Defining transformations between...
Barna Saha, Ioana Stanoi, Kenneth L. Clarkson
AUTOMATICA
2008
93views more  AUTOMATICA 2008»
13 years 7 months ago
An LFT approach to parameter estimation
In this paper we consider a unified framework for parameter estimation problems which arise in a system identification context. In this framework, the parameters to be estimated a...
Kenneth Hsu, Tyrone L. Vincent, Greg Wolodkin, Sun...
INFORMS
1998
150views more  INFORMS 1998»
13 years 7 months ago
Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
Alexander Bockmayr, Thomas Kasper