Sciweavers

7991 search results - page 547 / 1599
» Using More Reasoning to Improve
Sort
View
CP
2004
Springer
16 years 17 days ago
Hybrid Set Domains to Strengthen Constraint Propagation and Reduce Symmetries
In CP literature combinatorial design problems such as sport scheduling, Steiner systems, error-correcting codes and more, are typically solved using Finite Domain (FD) models desp...
Andrew Sadler, Carmen Gervet
CVPR
2007
IEEE
16 years 9 months ago
Cast Shadow Removal Combining Local and Global Features
In this paper, we present a method using pixel-level information, local region-level information and global-level information to remove shadow. At the pixel-level, we employ GMM t...
Zhou Liu, Kaiqi Huang, Tieniu Tan, Liangsheng Wang
CP
2009
Springer
16 years 7 months ago
The Complexity of Valued Constraint Models
The Valued Constraint Satisfaction Problem (VCSP) is a general framework encompassing many optimisation problems. We discuss precisely what it means for a problem to be modelled in...
Peter G. Jeavons, Stanislav Zivný
ICALP
2005
Springer
16 years 21 days ago
Password-Based Encryption Analyzed
Abstract. The use of passwords in security protocols is particularly delicate because of the possibility of off-line guessing attacks. We study password-based protocols in the cont...
Martín Abadi, Bogdan Warinschi
CIA
2001
Springer
15 years 11 months ago
Cryptographic Protocols for Secure Second-Price Auctions
In recent years auctions have become more and more important in the field of multiagent systems as useful mechanisms for resource allocation, task assignment and last but not leas...
Felix Brandt