Sciweavers

1095 search results - page 97 / 219
» Algebraic Guide Generation
Sort
View
JGAA
2007
93views more  JGAA 2007»
13 years 9 months ago
Large-Graph Layout Algorithms at Work: An Experimental Study
In the last decade several algorithms that generate straight-line drawings of general large graphs have been invented. In this paper we investigate some of these methods that are ...
Stefan Hachul, Michael Jünger
ML
2000
ACM
103views Machine Learning» more  ML 2000»
13 years 9 months ago
Nonparametric Time Series Prediction Through Adaptive Model Selection
We consider the problem of one-step ahead prediction for time series generated by an underlying stationary stochastic process obeying the condition of absolute regularity, describi...
Ron Meir
NA
2010
87views more  NA 2010»
13 years 7 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
IJMMSC
2010
67views more  IJMMSC 2010»
13 years 4 months ago
Universal Verma Modules and the Misra-Miwa Fock Space
The Misra-Miwa v-deformed Fock space is a representation of the quantized affine algebra Uv(bsl ). It has a standard basis indexed by partitions and the non-zero matrix entries of ...
Arun Ram, Peter Tingley
DATE
2008
IEEE
93views Hardware» more  DATE 2008»
14 years 3 months ago
A Fast Approximation Algorithm for MIN-ONE SAT
In this paper, we propose a novel approximation algorithm (RelaxSAT) for MIN-ONE SAT. RelaxSAT generates a set of constraints from the objective function to guide the search. The ...
Lei Fang, Michael S. Hsiao