Sciweavers

2300 search results - page 242 / 460
» Maximally Concurrent Programs
Sort
View
IJCAI
2003
15 years 8 months ago
Use of Off-line Dynamic Programming for Efficient Image Interpretation
An interpretation system finds the likely mappings from portions of an image to real-world objects. An interpretation policy specifies when to apply which imaging operator, to whi...
Ramana Isukapalli, Russell Greiner
WINE
2010
Springer
164views Economy» more  WINE 2010»
15 years 4 months ago
Incentives in Online Auctions via Linear Programming
Online auctions in which items are sold in an online fashion with little knowledge about future bids are common in the internet environment. We study here a problem in which an auc...
Niv Buchbinder, Kamal Jain, Mohit Singh
ESOP
2000
Springer
15 years 10 months ago
Improving the Representation of Infinite Trees to Deal with Sets of Trees
In order to deal efficiently with infinite regular trees (or other pointed graph structures), we give new algorithms to store such structures. The trees are stored in such a way th...
Laurent Mauborgne
COR
2010
108views more  COR 2010»
15 years 6 months ago
GRASP and path relinking for the max-min diversity problem
The Max-Min Diversity Problem (MMDP) consists in selecting a subset of elements from a given set in such a way that the diversity among the selected elements is maximized. The prob...
Mauricio G. C. Resende, Rafael Martí, Micae...
ICASSP
2011
IEEE
14 years 10 months ago
Optimized capacity bounds for the MIMO relay channel
This paper addresses the optimization of upper and lower bounds on the capacity of the multiple-input multiple-output (MIMO) relay channel. In particular, we show that evaluating ...
Lennart Gerdes, Wolfgang Utschick