Sciweavers

4934 search results - page 72 / 987
» complexity 2008
Sort
View
JUCS
2008
151views more  JUCS 2008»
15 years 3 months ago
The Bit-Complexity of Finding Nearly Optimal Quadrature Rules for Weighted Integration
: Given a probability measure and a positive integer n. How to choose n knots and n weights such that the corresponding quadrature rule has the minimum worst-case error when appli...
Volker Bosserhoff
SIAMDM
2008
190views more  SIAMDM 2008»
15 years 3 months ago
On the Complexity of Ordered Colorings
We introduce two variants of proper colorings with imposed partial ordering on the set of colors. One variant shows very close connections to some fundamental problems in graph the...
Arvind Gupta, Jan van den Heuvel, Ján Manuc...
TCS
2008
15 years 3 months ago
The cost of offline binary search tree algorithms and the complexity of the request sequence
In evaluating the performance of online algorithms for search trees, one wants to compare them to the best offline algorithm available. In this paper we lower bound the cost of an...
Jussi Kujala, Tapio Elomaa
TSI
2008
89views more  TSI 2008»
15 years 3 months ago
RedGRID, un environnement pour la redistribution d'objets complexes
In the context of code coupling, efficient data redistribution is a crucial issue to reach high-performances. However, most of the works in this area have limited their studies to ...
Aurélien Esnard
TSP
2008
74views more  TSP 2008»
15 years 3 months ago
Performance of ESPRIT for Estimating Mixtures of Complex Exponentials Modulated by Polynomials
High Resolution (HR) methods are known to provide accurate frequency estimates for discrete spectra. The Polynomial Amplitude Complex Exponentials (PACE) model, also called quasipo...
Roland Badeau, Gaël Richard, Bertrand David