Sciweavers

1362 search results - page 149 / 273
» Means, Correlations and Bounds
Sort
View
NA
2007
100views more  NA 2007»
15 years 1 months ago
Periodization strategy may fail in high dimensions
Abstract. We discuss periodization of smooth functions f of d variables for approximation of multivariate integrals. The benefit of periodization is that we may use lattice rules,...
Frances Y. Kuo, Ian H. Sloan, Henryk Wozniakowski
PAMI
2007
176views more  PAMI 2007»
15 years 1 months ago
Approximate Labeling via Graph Cuts Based on Linear Programming
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
Nikos Komodakis, Georgios Tziritas
ICSOC
2010
Springer
15 years 1 days ago
Adaptive Management of Composite Services under Percentile-Based Service Level Agreements
We present a brokering service for the adaptive management of composite services. The goal of this broker is to dynamically adapt at runtime the composite service configuration, ...
Valeria Cardellini, Emiliano Casalicchio, Vincenzo...
IJCGA
2010
155views more  IJCGA 2010»
15 years 17 hour ago
Competitive Complexity of Mobile Robot on-Line Motion Planning Problems
This paper is concerned with on-line problems where a mobile robot of size D has to achieve a task in an unknown planar environment whose geometry is acquired by the robot during ...
Yoav Gabriely, Elon Rimon
TALG
2010
110views more  TALG 2010»
14 years 12 months ago
Approximating fractional hypertree width
Fractional hypertree width is a hypergraph measure similar to tree width and hypertree width. Its algorithmic importance comes from the fact that, as shown in previous work [14], ...
Dániel Marx