945 search results - page 189 / 189 » On the robustness of primitive words |
SIAMSC
2010
12 years 11 months ago
2010
In this paper we present HUND, a hypergraph-based unsymmetric nested dissection ordering algorithm for reducing the fill-in incurred during Gaussian elimination. HUND has several i...
SIAMSC
2010
12 years 11 months ago
2010
Abstract. BDDC algorithms are constructed and analyzed for the system of almost incompressible elasticity discretized with Gauss-Lobatto-Legendre spectral elements in three dimensi...
SIGECOM
2011
ACM
12 years 7 months ago
2011
ACM
ended abstract summarizes the research presented in Dr. Pardoe’s recently-completed Ph.D. thesis [Pardoe 2011]. The thesis considers how adaptive trading agents can take advantag...
NIS
1998
13 years 4 months ago
1998
The execution time of a large query depends mainly on the memory utilization which should avoid disk accesses for intermediate results. Poor memory management can hurt performance ...
SODA
2012
ACM
11 years 7 months ago
2012
ACM
Given a class of graphs F, we say that a graph G is universal for F, or F-universal, if every H ∈ F is contained in G as a subgraph. The construction of sparse universal graphs ...