Sciweavers

732 search results - page 107 / 147
» corr 2011
Sort
View
CORR
2011
Springer
186views Education» more  CORR 2011»
14 years 10 months ago
On the Complexity of Solving a Bivariate Polynomial System
We study the complexity of computing the real solutions of a bivariate polynomial system using the recently proposed algorithm Bisolve [3]. Bisolve is a classical elimination metho...
Pavel Emeliyanenko, Michael Sagraloff
135
Voted
CORR
2011
Springer
167views Education» more  CORR 2011»
14 years 10 months ago
Maximum Metric Spanning Tree made Byzantine Tolerant
Self-stabilization is a versatile approach to fault-tolerance since it permits a distributed system to recover from any transient fault that arbitrarily corrupts the contents of a...
Swan Dubois, Toshimitsu Masuzawa, Sébastien...
CORR
2011
Springer
127views Education» more  CORR 2011»
14 years 10 months ago
Is a probabilistic modeling
— A new standpoint on financial time series, without the use of any mathematical model and of probabilistic tools, yields not only a rigorous approach of trends and volatility, ...
Michel Fliess, Cédric Join, Fréd&eac...
CORR
2011
Springer
239views Education» more  CORR 2011»
14 years 10 months ago
From Linked Data to Relevant Data -- Time is the Essence
The Semantic Web initiative puts emphasis not primarily on putting data on the Web, but rather on creating links in a way that both humans and machines can explore the Web of data...
Markus Kirchberg, Ryan K. L. Ko, Bu Sung Lee
CORR
2011
Springer
168views Education» more  CORR 2011»
14 years 10 months ago
Submodular meets Spectral: Greedy Algorithms for Subset Selection, Sparse Approximation and Dictionary Selection
We study the problem of selecting a subset of k random variables from a large set, in order to obtain the best linear prediction of another variable of interest. This problem can ...
Abhimanyu Das, David Kempe