3367 search results - page 220 / 674 » Incremental assignment problem |
193
click to vote
CVPR
2012
IEEE
13 years 8 months ago
2012
IEEE
We consider the problem of minimum distortion intrinsic correspondence between deformable shapes, many useful formulations of which give rise to the NP-hard quadratic assignment p...
185
click to vote
ESA
2007
Springer
16 years 18 days ago
2007
Springer
We study the partial capacitated vertex cover problem (pcvc) in which the input consists of a graph G and a covering requirement L. Each edge e in G is associated with a demand (o...
149
click to vote
GPCE
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. This paper presents FeatureC++, a novel language extension to C++ that supports Feature-Oriented Programming (FOP) and Aspect-Oriented Programming (AOP). Besides well-kno...
162
click to vote
MFCS
2004
Springer
15 years 11 months ago
2004
Springer
Let G = (V, E) be a (directed) graph with vertex set V and edge (arc) set E. Given a set P of (source-sink) pairs of vertices of G, an important problem that arises in the computat...
155
click to vote
DAWAK
1999
Springer
15 years 10 months ago
1999
Springer
A data warehouse DW can be seen as a set of materialized views de ned over remote base relations. When a query is posed, it is evaluated locally, using the materialized views, wi...