Sciweavers

450 search results - page 50 / 90
» Satisfiability with Exponential Families
Sort
View
COCO
2007
Springer
89views Algorithms» more  COCO 2007»
15 years 6 months ago
Testing Properties of Constraint-Graphs
We study a model of graph related formulae that we call the Constraint-Graph model. A constraintgraph is a labeled multi-graph (a graph where loops and parallel edges are allowed)...
Shirley Halevy, Oded Lachish, Ilan Newman, Dekel T...
EOR
2010
110views more  EOR 2010»
14 years 12 months ago
Online scheduling policies for multiclass call centers with impatient customers
We consider a call center with two classes of impatient customers: premium and regular classes. Modeling our call center as a multiclass GI/GI/s + M queue, we focus on developing ...
Oualid Jouini, Auke Pot, Ger Koole, Yves Dallery
ECCC
2008
122views more  ECCC 2008»
14 years 12 months ago
Every Minor-Closed Property of Sparse Graphs is Testable
Testing a property P of graphs in the bounded degree model is the following computational problem: given a graph G of bounded degree d we should distinguish (with probability 0.9,...
Itai Benjamini, Oded Schramm, Asaf Shapira
DICTA
2009
14 years 9 months ago
Multi-projective Parameter Estimation for Sets of Homogeneous Matrices
A number of problems in computer vision require the estimation of a set of matrices, each of which is defined only up to an individual scale factor and represents the parameters of...
Wojciech Chojnacki, Rhys Hill, Anton van den Henge...
STOC
2005
ACM
96views Algorithms» more  STOC 2005»
16 years 4 days ago
Every monotone graph property is testable
A graph property is called monotone if it is closed under taking (not necessarily induced) subgraphs (or, equivalently, if it is closed under removal of edges and vertices). Many ...
Noga Alon, Asaf Shapira