Sciweavers

2031 search results - page 7 / 407
» On Tree-Constrained Matchings and Generalizations
Sort
View
SIAMSC
2008
187views more  SIAMSC 2008»
14 years 9 months ago
The Generalized Singular Value Decomposition and the Method of Particular Solutions
A powerful method for solving planar eigenvalue problems is the Method of Particular Solutions (MPS), which is also well known under the name "point matching method". In ...
Timo Betcke
TOG
2012
184views Communications» more  TOG 2012»
13 years 1 days ago
Point sampling with general noise spectrum
Point samples with different spectral noise properties (often defined using color names such as white, blue, green, and red) are important for many science and engineering discip...
Yahan Zhou, Haibin Huang, Li-Yi Wei, Rui Wang
PE
2006
Springer
145views Optimization» more  PE 2006»
14 years 9 months ago
Closed form solutions for mapping general distributions to quasi-minimal PH distributions
Approximating general distributions by phase-type (PH) distributions is a popular technique in stochastic analysis, since the Markovian property of PH distributions often allows a...
Takayuki Osogami, Mor Harchol-Balter
JCT
2000
81views more  JCT 2000»
14 years 9 months ago
Generalized Rook Polynomials
Generalizing the notion of placing rooks on a Ferrers board leads to a new class of combinatorial models and a new class of rook polynomials. Connections are establishedwith absolu...
Jay Goldman, James Haglund
ECCC
2010
87views more  ECCC 2010»
14 years 7 months ago
Testing monotonicity of distributions over general partial orders
We investigate the number of samples required for testing the monotonicity of a distribution with respect to an arbitrary underlying partially ordered set. Our first result is a n...
Arnab Bhattacharyya, Eldar Fischer, Ronitt Rubinfe...