Sciweavers

2609 search results - page 124 / 522
» Models for Global Constraint Applications
Sort
View
ICDE
2012
IEEE
277views Database» more  ICDE 2012»
13 years 6 months ago
Aggregate Query Answering on Possibilistic Data with Cardinality Constraints
— Uncertainties in data arise for a number of reasons: when the data set is incomplete, contains conflicting information or has been deliberately perturbed or coarsened to remov...
Graham Cormode, Divesh Srivastava, Entong Shen, Ti...
CVPR
2008
IEEE
16 years 6 months ago
Object recognition and segmentation by non-rigid quasi-dense matching
In this paper, we present a non-rigid quasi-dense matching method and its application to object recognition and segmentation. The matching method is based on the match propagation...
Esa Rahtu, Janne Heikkilä, Juho Kannala, Sami...
CODES
2007
IEEE
15 years 10 months ago
Probabilistic performance risk analysis at system-level
We present a novel hybrid approach for performance analysis of a system design. Unlike other approaches in this area, in this paper we do not focus on the determination of pessimi...
Alexander Viehl, Markus Schwarz, Oliver Bringmann,...
SIGECOM
2006
ACM
138views ECommerce» more  SIGECOM 2006»
15 years 10 months ago
Bid expressiveness and clearing algorithms in multiattribute double auctions
We investigate the space of two-sided multiattribute auctions, focusing on the relationship between constraints on the offers traders can express through bids, and the resulting c...
Yagil Engel, Michael P. Wellman, Kevin M. Lochner
CPAIOR
2010
Springer
15 years 8 months ago
A Constraint Programming Approach for the Service Consolidation Problem
In this paper, we present a constraint programming approach for the service consolidation problem that is being currently tackled by Neptuny, Milan. The problem is defined as: Giv...
Kanika Dhyani, Stefano Gualandi, Paolo Cremonesi