Sciweavers

366 search results - page 49 / 74
» Dynamic Programming for Graphs on Surfaces
Sort
View
ICIP
2006
IEEE
14 years 9 months ago
A New Method for Boundary-Based Shape Matching and Retrieval
This paper presents a novel method for efficient boundary based shapes matching and retrieval in presence of occlusion. In this method, the geometric and topological information o...
Minh-Son Dao, Raffaele de Amicis
VALUETOOLS
2006
ACM
176views Hardware» more  VALUETOOLS 2006»
14 years 1 months ago
How to solve large scale deterministic games with mean payoff by policy iteration
Min-max functions are dynamic programming operators of zero-sum deterministic games with finite state and action spaces. The problem of computing the linear growth rate of the or...
Vishesh Dhingra, Stephane Gaubert
UM
2005
Springer
14 years 28 days ago
ExpertiseNet: Relational and Evolutionary Expert Modeling
We develop a novel user-centric modeling technology, which can dynamically describe and update a person's expertise profile. In an enterprise environment, the technology can e...
Xiaodan Song, Belle L. Tseng, Ching-Yung Lin, Ming...
ESA
2004
Springer
103views Algorithms» more  ESA 2004»
14 years 25 days ago
Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems
Abstract. We obtain faster algorithms for problems such as rdimensional matching, r-set packing, graph packing, and graph edge packing when the size k of the solution is considered...
Michael R. Fellows, Christian Knauer, Naomi Nishim...
ATAL
2007
Springer
13 years 11 months ago
Workflow coordination for service-oriented multiagent systems
From a multiagent viewpoint, a workflow is a dynamic set of tasks performed by a set of agents to reach a shared goal. We show herein that commitments among agents can be used to ...
Jiangbo Dang, Jingshan Huang, Michael N. Huhns