Sciweavers

969 search results - page 50 / 194
» Programming as Problem Solving: A Participatory Theater Appr...
Sort
View
IANDC
2006
86views more  IANDC 2006»
14 years 10 months ago
Table design in dynamic programming
Dynamic Programming solves combinatorial optimization problems by recursive decomposition and tabulation of intermediate results. The first step in the design of a dynamic program...
Peter Steffen, Robert Giegerich
85
Voted
VLDB
2005
ACM
134views Database» more  VLDB 2005»
15 years 3 months ago
MDL Summarization with Holes
Summarization of query results is an important problem for many OLAP applications. The Minimum Description Length principle has been applied in various studies to provide summarie...
Shaofeng Bu, Laks V. S. Lakshmanan, Raymond T. Ng
SIAMJO
2008
139views more  SIAMJO 2008»
14 years 10 months ago
An Augmented Primal-Dual Method for Linear Conic Programs
We propose a new iterative approach for solving linear programs over convex cones. Assuming that Slaters condition is satisfied, the conic problem is transformed to the minimizatio...
Florian Jarre, Franz Rendl
EMNLP
2010
14 years 8 months ago
On Dual Decomposition and Linear Programming Relaxations for Natural Language Processing
This paper introduces dual decomposition as a framework for deriving inference algorithms for NLP problems. The approach relies on standard dynamic-programming algorithms as oracl...
Alexander M. Rush, David Sontag, Michael Collins, ...
ISSRE
2007
IEEE
14 years 11 months ago
Improving Constraint-Based Testing with Dynamic Linear Relaxations
Constraint-Based Testing (CBT) is the process of generating test cases against a testing objective by using constraint solving techniques. In CBT, testing objectives are given und...
Tristan Denmat, Arnaud Gotlieb, Mireille Ducass&ea...