Sciweavers

2061 search results - page 309 / 413
» The continuous knapsack set
Sort
View
MP
2008
135views more  MP 2008»
14 years 10 months ago
A path to the Arrow-Debreu competitive market equilibrium
: We present polynomial-time interior-point algorithms for solving the Fisher and Arrow-Debreu competitive market equilibrium problems with linear utilities and n players. Both of ...
Yinyu Ye
LMCS
2006
79views more  LMCS 2006»
14 years 10 months ago
Computably Based Locally Compact Spaces
tract Stone Duality) is a re-axiomatisation of general topology in which the topology on a space is treated, not as an infinitary lattice, but as an exponential object of the same...
Paul Taylor 0002
ML
2006
ACM
113views Machine Learning» more  ML 2006»
14 years 10 months ago
Learning to bid in bridge
Bridge bidding is considered to be one of the most difficult problems for game-playing programs. It involves four agents rather than two, including a cooperative agent. In additio...
Asaf Amit, Shaul Markovitch
PAMI
2008
147views more  PAMI 2008»
14 years 10 months ago
Image Stitching Using Structure Deformation
The aim of this paper is to achieve seamless image stitching without producing visual artifact caused by severe intensity discrepancy and structure misalignment, given that the inp...
Jiaya Jia, Chi-Keung Tang
PAMI
2006
153views more  PAMI 2006»
14 years 9 months ago
On-Road Vehicle Detection: A Review
Developing on-board automotive driver assistance systems aiming to alert drivers about driving environments, and possible collision with other vehicles has attracted a lot of atten...
Zehang Sun, George Bebis, Ronald Miller