Sciweavers

325 search results - page 12 / 65
» Remarks on the Schoof-Elkies-Atkin algorithm
Sort
View
ESANN
2004
13 years 11 months ago
Soft-computing techniques for time series forecasting
One way to contrast the behaviour of different algorithms in the field of timeseries forecasting is to compare the prediction error using a benchmark problem. Another interesting ...
Ignacio Rojas Ruiz, Héctor Pomares
DAM
2008
145views more  DAM 2008»
13 years 10 months ago
Graph coloring in the estimation of sparse derivative matrices: Instances and applications
We describe a graph coloring problem associated with the determination of mathematical derivatives. The coloring instances are obtained as intersection graphs of row partitioned s...
Shahadat Hossain, Trond Steihaug
JSAT
2006
114views more  JSAT 2006»
13 years 9 months ago
Semidefinite Optimization Approaches for Satisfiability and Maximum-Satisfiability Problems
Semidefinite optimization, commonly referred to as semidefinite programming, has been a remarkably active area of research in optimization during the last decade. For combinatoria...
Miguel F. Anjos
TWC
2008
104views more  TWC 2008»
13 years 9 months ago
Multiple symbol differential detection for UWB communications
In ultra-wideband (UWB) communications, the typical signal propagation through dense multipath fading offers potentially very large multipath diversity, but at the same time compl...
Vincenzo Lottici, Zhi Tian
CG
2002
Springer
13 years 9 months ago
Tackling Post's Correspondence Problem
Abstract. Post's correspondence problem (PCP) is a classic undecidable problem. Its theoretical unbounded search space makes it hard to judge whether a PCP instance has a solu...
Ling Zhao