Sciweavers

2887 search results - page 158 / 578
» Name Generation and Linearity
Sort
View
NA
2010
87views more  NA 2010»
15 years 4 months ago
A note on the O(n)-storage implementation of the GKO algorithm and its adaptation to Trummer-like matrices
We propose a new O(n)-space implementation of the GKO-Cauchy algorithm for the solution of linear systems where the coefficient matrix is Cauchy-like. Moreover, this new algorithm...
Federico Poloni
CC
2010
Springer
112views System Software» more  CC 2010»
15 years 29 days ago
Random Cnf's are Hard for the Polynomial Calculus
We show a general reduction that derives lower bounds on degrees of polynomial calculus proofs of tautologies over any field of characteristic other than 2 from lower bounds for r...
Eli Ben-Sasson, Russell Impagliazzo
ICDE
2007
IEEE
172views Database» more  ICDE 2007»
16 years 24 days ago
A New Data Cube for Integrating Data Mining and OLAP
Recently there is much need of discovering useful knowledge from massive log-data which are generated by Webbased information systems. Such log-data have multiple attributes about...
Tadashi Ohmori, Masahide Naruse, Mamoru Hoshi
SCAM
2007
IEEE
16 years 23 days ago
The Programmer's Lexicon, Volume I: The Verbs
ames make or break abstractions: good ones communicate the intention of the method, whereas bad ones cause confusion and frustration. The task of naming is subject to the whims an...
Einar W. Høst, Bjarte M. Østvold
CCA
2005
Springer
16 years 18 hour ago
Representing Probability Measures using Probabilistic Processes
In the Type-2 Theory of Effectivity, one considers representations of topological spaces in which infinite words are used as “names” for the elements they represent. Given s...
Matthias Schröder, Alex K. Simpson