Sciweavers

2827 search results - page 255 / 566
» Robustness of PSPACE-complete sets
Sort
View
ORL
2008
99views more  ORL 2008»
15 years 4 months ago
Some tractable instances of interval data minmax regret problems
This paper focuses on tractable instances of interval data minmax regret graph problems. More precisely, we provide polynomial and pseudopolynomial algorithms for sets of particul...
Bruno Escoffier, Jérôme Monnot, Olivi...
CVIU
2004
114views more  CVIU 2004»
15 years 4 months ago
Illumination insensitive recognition using eigenspaces
Variations in illumination can have a dramatic effect on the appearance of an object in an image. In this paper, we propose how to deal with illumination variations in eigenspace ...
Horst Bischof, Horst Wildenauer, Ales Leonardis
CGF
2000
96views more  CGF 2000»
15 years 4 months ago
An interactive approach to point cloud triangulation
We present an interactive system for the generation of high quality triangle meshes that allows us to handle hybrid geometry (point clouds, polygons, ...) as input data. In order ...
Leif Kobbelt, Mario Botsch
ML
2000
ACM
15 years 4 months ago
Maximizing Theory Accuracy Through Selective Reinterpretation
Existing methods for exploiting awed domain theories depend on the use of a su ciently large set of training examples for diagnosing and repairing aws in the theory. In this paper,...
Shlomo Argamon-Engelson, Moshe Koppel, Hillel Walt...
TON
1998
103views more  TON 1998»
15 years 3 months ago
Using name-based mappings to increase hit rates
—Clusters of identical intermediate servers are often created to improve availability and robustness in many domains. The use of proxy servers for the World Wide Web (WWW) and of...
David Thaler, Chinya V. Ravishankar