Sciweavers

1941 search results - page 198 / 389
» On the Hardness of Approximate Reasoning
Sort
View
JAIR
2010
139views more  JAIR 2010»
15 years 4 months ago
Multiattribute Auctions Based on Generalized Additive Independence
We develop multiattribute auctions that accommodate generalized additive independent (GAI) preferences. We propose an iterative auction mechanism that maintains prices on potentia...
Yagil Engel, Michael P. Wellman
ANOR
2010
112views more  ANOR 2010»
15 years 4 months ago
Online stochastic optimization under time constraints
This paper considers online stochastic optimization problems where uncertainties are characterized by a distribution that can be sampled and where time constraints severely limit t...
Pascal Van Hentenryck, Russell Bent, Eli Upfal
CNSR
2011
IEEE
257views Communications» more  CNSR 2011»
14 years 10 months ago
On Threshold Selection for Principal Component Based Network Anomaly Detection
—Principal component based anomaly detection has emerged as an important statistical tool for network anomaly detection. It works by projecting summary network information onto a...
Petar Djukic, Biswajit Nandy
CONCUR
2012
Springer
13 years 9 months ago
Making Weighted Containment Feasible: A Heuristic Based on Simulation and Abstraction
Simulation and Abstraction Guy Avni and Orna Kupferman School of Computer Science and Engineering, Hebrew University, Israel Weighted automata map input words to real numbers and a...
Guy Avni, Orna Kupferman
CVPR
2009
IEEE
17 years 1 months ago
Stereo Matching in the Presence of Sub-Pixel Calibration Errors
Stereo matching commonly requires rectified images that are computed from calibrated cameras. Since all under- lying parametric camera models are only approximations, calibratio...
Heiko Hirschmüller, Stefan K. Gehrig