Sciweavers

2 search results - page 1 / 1
» Polynomial algorithms for subisomorphism of nD open combinat...
Sort
View
CVIU
2011
12 years 11 months ago
Polynomial algorithms for subisomorphism of nD open combinatorial maps
Combinatorial maps describe the subdivision of objects in cells, and incidence and adjacency relations between cells, and they are widely used to model 2D and 3D images. However, ...
Guillaume Damiand, Christine Solnon, Colin de la H...
WINE
2009
Springer
178views Economy» more  WINE 2009»
14 years 2 months ago
Computing Optimal Contracts in Series-Parallel Heterogeneous Combinatorial Agencies
We study an economic setting in which a principal motivates a team of strategic agents to exert costly effort toward the success of a joint project. The action taken by each agent...
Yuval Emek, Michal Feldman