Sciweavers

23 search results - page 3 / 5
» Sublinear algorithms for testing monotone and unimodal distr...
Sort
View
APPROX
2010
Springer
168views Algorithms» more  APPROX 2010»
13 years 6 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,...
APPROX
2007
Springer
153views Algorithms» more  APPROX 2007»
13 years 11 months ago
Distribution-Free Testing Lower Bounds for Basic Boolean Functions
: In the distribution-free property testing model, the distance between functions is measured with respect to an arbitrary and unknown probability distribution D over the input dom...
Dana Glasner, Rocco A. Servedio
ISCAPDCS
2004
13 years 6 months ago
Distributed Algorithms for DCOP: A Graphical-Game-Based Approach
This paper addresses the application of distributed constraint optimization problems (DCOPs) to large-scale dynamic environments. We introduce a decomposition of DCOP into a graph...
Rajiv T. Maheswaran, Jonathan P. Pearce, Milind Ta...
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
13 years 11 months ago
SDR: a better trigger for adaptive variance scaling in normal EDAs
Recently, advances have been made in continuous, normal– distribution–based Estimation–of–Distribution Algorithms (EDAs) by scaling the variance up from the maximum–like...
Peter A. N. Bosman, Jörn Grahl, Franz Rothlau...
CVPR
2011
IEEE
13 years 1 months ago
Scalable Multi-class Object Detection
Scalability of object detectors with respect to the number of classes is a very important issue for applications where many object classes need to be detected. While combining sin...
Nima Razavi, Juergen Gall, Luc VanGool