Sciweavers

882 search results - page 27 / 177
» On self-embeddings of computable linear orderings
Sort
View
JSC
2010
155views more  JSC 2010»
13 years 7 months ago
Algorithms for solving linear systems over cyclotomic fields
We consider the problem of solving a linear system Ax = b over a cyclotomic field. What makes cyclotomic fields of special interest is that we can easily find a prime p that sp...
Liang Chen, Michael B. Monagan
IPPS
2000
IEEE
14 years 27 days ago
On Sorting an Intransitive Total Ordered Set Using Semi-Heap
1 The problem of sorting an intransitive total ordered set, a generalization of regular sorting, is considered. This generalized sorting is based on the fact that there exists a s...
Jie Wu
ICASSP
2011
IEEE
13 years 7 days ago
Parallel computation of adaptive lattice filters
Parallel computation of the adaptive lattice filtering algorithm is difficult due to the dependency problem caused by feedback operations. The conventional control-level paralle...
Dong-hwan Lee, Wonyong Sung
WSC
1997
13 years 9 months ago
Computational Efficiency Evaluation in Output Analysis
A central quantity in steady-state simulation is the time-average variance constant. Estimates of this quantity are needed (for example) for constructing confidence intervals, an...
Halim Damerdji, Shane G. Henderson, Peter W. Glynn
CORR
2007
Springer
104views Education» more  CORR 2007»
13 years 8 months ago
Separable convex optimization problems with linear ascending constraints
Separable convex optimization problems with linear ascending inequality and equality constraints are addressed in this paper. An algorithm that explicitly characterizes the optimum...
Arun Padakandla, Rajesh Sundaresan