Sciweavers

4451 search results - page 386 / 891
» On Random Ordering Constraints
Sort
View
SODA
2010
ACM
201views Algorithms» more  SODA 2010»
16 years 4 months ago
Incentive Compatible Budget Elicitation in Multi-unit Auctions
In this paper, we consider the problem of designing incentive compatible auctions for multiple (homogeneous) units of a good, when bidders have private valuations and private budg...
Sayan Bhattacharya, Vincent Conitzer, Kamesh Munag...
DC
2011
14 years 6 months ago
Distributed algorithms for covering, packing and maximum weighted matching
Abstract This paper gives poly-logarithmic-round, distributed δ-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-c...
Christos Koufogiannakis, Neal E. Young
CVPR
2004
IEEE
16 years 8 months ago
Linear Model Hashing and Batch RANSAC for Rapid and Accurate Object Recognition
This paper proposes a joint feature-based model indexing and geometric constraint based alignment pipeline for efficient and accurate recognition of 3D objects from a large model ...
Ying Shan, Bogdan Matei, Harpreet S. Sawhney, Rake...
STOC
2010
ACM
216views Algorithms» more  STOC 2010»
16 years 4 months ago
The HOM problem is decidable
We close affirmatively a question which has been open for long time: decidability of the HOM problem. The HOM problem consists in determining, given a tree homomorphism D and a re...
Guillem Godoy, Omer Giménez, Lander Ramos and Car...
ECWEB
2004
Springer
148views ECommerce» more  ECWEB 2004»
16 years 6 days ago
OCL-Constraints for UMM Business Collaborations
Abstract. Recently, a trend towards business processes in Business-toBusiness e-Commerce (B2B) is apparent. One of the most promising approaches is UN/CEFACT’s modeling methodolo...
Birgit Hofreiter, Christian Huemer, Werner Winiwar...