173 search results - page 15 / 35 » Asymptotic classes of finite structures |
TON
1998
15 years 3 days ago
1998
—The notion of effective bandwidths has provided a useful practical framework for connection admission control and capacity planning in high-speed communication networks. The ass...
115
Voted
CSL
2010
Springer
15 years 1 months ago
2010
Springer
Our goal is to identify families of relations that are useful for reasoning about software. We describe such families using decidable quantifier-free classes of logical constraints...
101
Voted
NIPS
2004
15 years 1 months ago
2004
We develop a family of upper and lower bounds on the worst-case expected KL loss for estimating a discrete distribution on a finite number m of points, given N i.i.d. samples. Our...
122
click to vote
BIRTHDAY
2010
Springer
15 years 1 months ago
2010
Springer
The question of whether there is a logic that captures polynomial time was formulated by Yuri Gurevich in 1988. It is still wide open and regarded as one of the main open problems...
CSDA
2010
15 years 16 days ago
2010
Confirmatory factor analysis (CFA) is a data anylsis procedure that is widely used in social and behavioral sciences in general and other applied sciences that deal with large qua...