Sciweavers

1139 search results - page 106 / 228
» Bounded Ideation Theory
Sort
View
SODA
1997
ACM
95views Algorithms» more  SODA 1997»
13 years 9 months ago
Randomly Sampling Molecules
We give a polynomial-time algorithm for the following problem: Given a degree sequence in which each degree is bounded from above by a constant, select, uniformly at random, an un...
Leslie Ann Goldberg, Mark Jerrum
CSDA
2010
99views more  CSDA 2010»
13 years 8 months ago
Robust M-estimation of multivariate GARCH models
In empirical work on multivariate financial time series, it is common to postulate a Multivariate GARCH model. We show that the popular Gaussian quasi-maximum likelihood estimator...
Kris Boudt, Christophe Croux
IJUFKS
2006
64views more  IJUFKS 2006»
13 years 8 months ago
Cautious Analysis of Project Risks by Interval-Valued Initial Data
One of the most common performance measures in selection and management of projects is the Net Present Value (NPV). In the paper, we study a case when initial data about the NPV p...
Lev V. Utkin
JC
2006
105views more  JC 2006»
13 years 8 months ago
On the complexity of the resolvent representation of some prime differential ideals
We prove upper bounds on the order and degree of the polynomials involved in a resolvent representation of the prime differential ideal associated with a polynomial differential s...
Lisi D'Alfonso, Gabriela Jeronimo, Pablo Solern&oa...
MSS
2008
IEEE
72views Hardware» more  MSS 2008»
13 years 8 months ago
Measurable systems and behavioral sciences
Individual choices often depend on the order in which the decisions are made. In this paper, we expose a general theory of measurable systems (an example of which is an individual...
V. I. Danilov, Ariane Lambert-Mogiliansky