Sciweavers

8431 search results - page 1591 / 1687
» Algorithmically Independent Sequences
Sort
View
IDA
2002
Springer
14 years 9 months ago
Classification with sparse grids using simplicial basis functions
Recently we presented a new approach [20] to the classification problem arising in data mining. It is based on the regularization network approach but in contrast to other methods...
Jochen Garcke, Michael Griebel
MOC
1998
93views more  MOC 1998»
14 years 9 months ago
Computing ray class groups, conductors and discriminants
We use the algorithmic computation of exact sequences of Abelian groups to compute the complete structure of (ZK /m)∗ for an ideal m of a number field K, as well as ray class gr...
Henri Cohen, Francisco Diaz y Diaz, Michel Olivier
TNN
1998
123views more  TNN 1998»
14 years 9 months ago
A general framework for adaptive processing of data structures
—A structured organization of information is typically required by symbolic processing. On the other hand, most connectionist models assume that data are organized according to r...
Paolo Frasconi, Marco Gori, Alessandro Sperduti
TRIER
2002
14 years 9 months ago
Precise Interprocedural Dependence Analysis of Parallel Programs
It is known that interprocedural detection of copy constants and elimination of faint code in parallel programs are undecidable problems, if base statements are assumed to execute...
Markus Müller-Olm
TPDS
2010
104views more  TPDS 2010»
14 years 8 months ago
From an Asynchronous Intermittent Rotating Star to an Eventual Leader
—Considering an asynchronous system made up of n processes and where up to t of them can crash, finding the weakest assumption that such a system has to satisfy for a common lea...
Antonio Fernández Anta, Michel Raynal
« Prev « First page 1591 / 1687 Last » Next »