Sciweavers

2181 search results - page 270 / 437
» The restriction scaffold problem
Sort
View
CONSTRAINTS
2011
14 years 7 months ago
CP and IP approaches to cancer radiotherapy delivery optimization
Abstract. We consider the problem of decomposing an integer matrix into a positively weighted sum of binary matrices that have the consecutive-ones property. This problem is well-k...
Davaatseren Baatar, Natashia Boland, Sebastian Bra...
DISOPT
2011
175views Education» more  DISOPT 2011»
14 years 7 months ago
Strengthening lattice-free cuts using non-negativity
In recent years there has been growing interest in generating valid inequalities for mixedinteger programs using sets with 2 or more constraints. In particular, Andersen et al. (2...
Ricardo Fukasawa, Oktay Günlük
ICCV
2011
IEEE
14 years 4 months ago
Learning Cross-modality Similarity for Multinomial Data
Many applications involve multiple-modalities such as text and images that describe the problem of interest. In order to leverage the information present in all the modalities, on...
Yangqing Jia, Mathieu Salzmann, Trevor Darrell
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
16 years 4 months ago
Lower bounds for dynamic connectivity
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
Mihai Patrascu, Erik D. Demaine
PODS
2007
ACM
159views Database» more  PODS 2007»
16 years 4 months ago
Generalized hypertree decompositions: np-hardness and tractable variants
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
Georg Gottlob, Thomas Schwentick, Zoltán Mi...