Sciweavers

204 search results - page 23 / 41
» Parameterizations of Test Cover with Bounded Test Sizes
Sort
View
JEI
2007
79views more  JEI 2007»
14 years 10 months ago
Stereo matching via selective multiple windows
Window-based correlation algorithms are widely used for stereo matching due to their computational efficiency as compared to global algorithms. In this paper, a multiple window co...
Satyajit Anil Adhyapak, Nasser D. Kehtarnavaz, Mih...
PDCN
2004
14 years 11 months ago
Scalable parallel algorithms for difficult combinatorial problems: A case study in optimization
A novel combination of emergent algorithmic methods, powerful computational platforms and supporting infrastructure is described. These complementary tools and technologies are us...
Faisal N. Abu-Khzam, Michael A. Langston, Pushkar ...
69
Voted
ICML
2007
IEEE
15 years 11 months ago
Efficiently computing minimax expected-size confidence regions
Given observed data and a collection of parameterized candidate models, a 1- confidence region in parameter space provides useful insight as to those models which are a good fit t...
Brent Bryan, H. Brendan McMahan, Chad M. Schafer, ...
APPROX
2010
Springer
168views Algorithms» more  APPROX 2010»
14 years 12 months ago
Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners
Abstract. Given a directed graph G = (V, E) and an integer k 1, a ktransitive-closure-spanner (k-TC-spanner) of G is a directed graph H = (V, EH ) that has (1) the same transitive...
Arnab Bhattacharyya, Elena Grigorescu, Madhav Jha,...
WSCG
2004
166views more  WSCG 2004»
14 years 11 months ago
Non-evaluated Manipulation of Complex CSG Solids
One of the most important problems to solve in Solid Modeling is computing boolean operations for solids (union, intersection and difference). In this paper we present a method to...
Rafael Jesús Segura, Francisco R. Feito, Ju...