1968 search results - page 139 / 394 » The Complexity of Valued Constraint Models |
162
click to vote
CVPR
2004
IEEE
16 years 6 months ago
2004
IEEE
Methods for expanding the dynamic range of digital photographs by combining images taken at different exposures have recently received a lot of attention. Current techniques assum...
114
Voted
ECIS
2000
15 years 5 months ago
2000
The aim of this study is to investigate the impact of various pre-processing models on the forecast capability of artificial neural network (ANN) when auditing financial accounts. ...
143
click to vote
SIGECOM
2008
ACM
15 years 4 months ago
2008
ACM
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
150
click to vote
ADC
2010
Springer
14 years 11 months ago
2010
Springer
Nowadays privacy becomes a major concern and many research efforts have been dedicated to the development of privacy protecting technology. Anonymization techniques provide an eff...
137
click to vote
STOC
2004
ACM
16 years 4 months ago
2004
ACM
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...