Sciweavers

2446 search results - page 351 / 490
» Choiceless Polynomial Time
Sort
View
CATS
2006
14 years 11 months ago
Graph Orientation Algorithms to Minimize the Maximum Outdegree
We study the problem of orienting the edges of a weighted graph such that the maximum weighted outdegree of vertices is minimized. This problem, which has applications in the guar...
Yuichi Asahiro, Eiji Miyano, Hirotaka Ono, Kouhei ...
72
Voted
FLAIRS
2006
14 years 11 months ago
Sensitivity Analysis of Markovian Models
Sensitivity analysis of Markovian models amounts to computing the constants in polynomial functions of a parameter under study. To handle the computational complexity involved, we...
Theodore Charitos, Linda C. van der Gaag
72
Voted
ICVGIP
2004
14 years 11 months ago
Fast and Robust Projective Matching for Fingerprints Using Geometric Hashing
Fingerprint matching is the most important module in automatic person recognition using fingerprints. We model the nonlinear distortions and noise obtained during the fingerprint ...
Rintu Boro, Sumantra Dutta Roy
116
Voted
CCCG
2003
14 years 11 months ago
Network Design Subject to Facility Location
We consider the problem of designing a transportation network to allow the residents of the network to avail service provided by a single facility whose location is predetermined....
Laxmi Gewali, Joy Bhadury, Ramaswamy Chandrasekara...
IJCAI
2001
14 years 11 months ago
Market Clearability
Market mechanisms play a central role in AI as a coordination tool in multiagent systems and as an application area for algorithm design. Mechanisms where buyers are directly clea...
Tuomas Sandholm, Subhash Suri