Sciweavers

2740 search results - page 16 / 548
» Approximating Component Selection
Sort
View
TACAS
2005
Springer
120views Algorithms» more  TACAS 2005»
15 years 3 months ago
Symbolic Test Selection Based on Approximate Analysis
This paper addresses the problem of generating symbolic test cases for testing the conformance of a black-box implementation with respect to a specification, in the context of rea...
Bertrand Jeannet, Thierry Jéron, Vlad Rusu,...
SIGMOD
2008
ACM
142views Database» more  SIGMOD 2008»
15 years 9 months ago
Cost-based variable-length-gram selection for string collections to support approximate queries efficiently
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
Xiaochun Yang, Bin Wang, Chen Li
81
Voted
EDBT
2009
ACM
127views Database» more  EDBT 2009»
15 years 4 months ago
Approximate substring selectivity estimation
We study the problem of estimating selectivity of approximate substring queries. Its importance in databases is ever increasing as more and more data are input by users and are in...
Hongrae Lee, Raymond T. Ng, Kyuseok Shim
ACIVS
2008
Springer
15 years 4 months ago
Sub-optimal Camera Selection in Practical Vision Networks through Shape Approximation
Within a camera network, the contribution of a camera to the observations of a scene depends on its viewpoint and on the scene configuration. This is a dynamic property, as the sc...
Huang Lee, Linda Tessens, Marleen Morbée, H...
JCAM
2011
69views more  JCAM 2011»
14 years 17 days ago
Comonotonic approximations for a generalized provisioning problem with application to optimal portfolio selection
In this paper we discuss multiperiod portfolio selection problems related to a speci…c provisioning problem. Our results are an extension of Dhaene et al. (2005), where optimal ...
Koen Van Weert, Jan Dhaene, Marc J. Goovaerts