Sciweavers

1615 search results - page 269 / 323
» Computer science and decision theory
Sort
View
ACMSE
2006
ACM
15 years 7 months ago
Achieving efficient polynomial multiplication in fermat fields using the fast Fourier transform
We introduce an efficient way of performing polynomial multiplication in a class of finite fields GF(pm ) in the frequency domain. The Fast Fourier Transform (FFT) based frequency...
Selçuk Baktir, Berk Sunar
125
Voted
SIGCSE
2008
ACM
171views Education» more  SIGCSE 2008»
15 years 4 months ago
Contributing student pedagogy
A Contributing Student Pedagogy (CSP) is a pedagogy that encourages students to contribute to the learning of others and to value the contributions of others. CSP in formal educat...
John Hamer, Quintin I. Cutts, Jana Jacková,...
TOMACS
2011
139views more  TOMACS 2011»
14 years 11 months ago
The double CFTP method
We consider the problem of the exact simulation of random variables Z that satisfy the distributional identity Z L = V Y + (1 − V )Z, where V ∈ [0, 1] and Y are independent, an...
Luc Devroye, Lancelot F. James
STOC
2006
ACM
166views Algorithms» more  STOC 2006»
16 years 4 months ago
New upper and lower bounds for randomized and quantum local search
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
Shengyu Zhang
SDM
2009
SIAM
152views Data Mining» more  SDM 2009»
16 years 1 months ago
Non-negative Matrix Factorization, Convexity and Isometry.
In this paper we explore avenues for improving the reliability of dimensionality reduction methods such as Non-Negative Matrix Factorization (NMF) as interpretive exploratory data...
Nikolaos Vasiloglou, Alexander G. Gray, David V. A...