Sciweavers

16596 search results - page 457 / 3320
» Generalized Assignment Problems
Sort
View
DBPL
2007
Springer
158views Database» more  DBPL 2007»
15 years 11 months ago
Efficient Algorithms for the Tree Homeomorphism Problem
Tree pattern matching is a fundamental problem that has a wide range of applications in Web data management, XML processing, and selective data dissemination. In this paper we deve...
Michaela Götz, Christoph Koch, Wim Martens
EVOW
2006
Springer
15 years 11 months ago
The Core Concept for the Multidimensional Knapsack Problem
Abstract. We present the newly developed core concept for the Multidimensional Knapsack Problem (MKP) which is an extension of the classical concept for the one-dimensional case. T...
Jakob Puchinger, Günther R. Raidl, Ulrich Pfe...
ESEM
2008
ACM
15 years 9 months ago
Problems in agile trenches
Some agile voices have been raised against extensive documentation. They advocate its sparse use and production. In this paper, we report from agile evolution and maintenance tren...
Mira Kajko-Mattsson
SODA
2000
ACM
114views Algorithms» more  SODA 2000»
15 years 9 months ago
The rectilinear Steiner arborescence problem is NP-complete
Given a set P of points in the first quadrant, a Rectilinear Steiner Arborescence (RSA) is a directed tree rooted at the origin, containing all points in P, and composed solely of...
Weiping Shi, Chen Su
CORR
2010
Springer
171views Education» more  CORR 2010»
15 years 7 months ago
Solving Inverse Problems with Piecewise Linear Estimators: From Gaussian Mixture Models to Structured Sparsity
A general framework for solving image inverse problems is introduced in this paper. The approach is based on Gaussian mixture models, estimated via a computationally efficient MAP...
Guoshen Yu, Guillermo Sapiro, Stéphane Mall...