142 search results - page 18 / 29 » Extended Weighted Pushdown Systems |
ECCV
1998
Springer
14 years 10 months ago
1998
Springer
?It is well-known that the problem of matching two relational structures can be posed as an equivalent problem of finding a maximal clique in a (derived) ?association graph.? Howev...
ATAL
2007
Springer
14 years 2 months ago
2007
Springer
In this paper, we examine the behavior of bidding agents that are in direct competition with the other participants in an auction setting. Thus the agents are not simply trying to...
3DIM
2003
IEEE
14 years 6 days ago
2003
IEEE
In this paper we present an efficient and general approach to computing and integrating 3D distance fields directly from multiple range images. We compute normal and confidence va...
DAGSTUHL
2006
13 years 10 months ago
2006
We study the online version of the classical parallel machine scheduling problem to minimize the total weighted completion time from a new perspective: We assume that the data of ...
JGAA
2000
13 years 8 months ago
2000
This paper considers problems of the following type: given an edgeweighted k-colored input graph with maximum color class size c, find a minimum or maximum c-way cut such that eac...