Sciweavers

1632 search results - page 242 / 327
» On special numberings of hypergraphs
Sort
View
CORR
2011
Springer
194views Education» more  CORR 2011»
15 years 1 months ago
Energy-Latency Tradeoff for In-Network Function Computation in Random Networks
—The problem of designing policies for in-network function computation with minimum energy consumption subject to a latency constraint is considered. The scaling behavior of the ...
Paul N. Balister, Béla Bollobás, Ani...
JACM
2011
98views more  JACM 2011»
15 years 1 months ago
Randomized algorithms for estimating the trace of an implicit symmetric positive semi-definite matrix
We analyze the convergence of randomized trace estimators. Starting at 1989, several algorithms have been proposed for estimating the trace of a matrix by 1 M M i=1 zT i Azi, where...
Haim Avron, Sivan Toledo
JCT
2011
74views more  JCT 2011»
15 years 1 months ago
Quasisymmetric Schur functions
Abstract. We introduce a new basis for quasisymmetric functions, which arise from a specialization of nonsymmetric Macdonald polynomials to standard bases, also known as Demazure a...
James Haglund, Kurt W. Luoto, Sarah Mason, Stephan...
JCT
2011
86views more  JCT 2011»
15 years 1 months ago
Descendant-homogeneous digraphs
The descendant set desc(α) of a vertex α in a digraph D is the set of vertices which can be reached by a directed path from α. A subdigraph of D is finitely generated if it is...
Daniela Amato, John K. Truss
SMA
2011
ACM
265views Solid Modeling» more  SMA 2011»
15 years 1 months ago
Modeling individual migraine severity with autoregressive ordered probit models
This paper considers the problem of modeling migraine severity assessments and their dependence on weather and time characteristics. We take on the viewpoint of a patient who is i...
Claudia Czado, Anette Heyn, Gernot Müller