Sciweavers

2432 search results - page 215 / 487
» Degrees and choice numbers
Sort
View
ICASSP
2010
IEEE
15 years 6 months ago
An adaptive level of detail approach to nonlinear estimation
In this work, we present a general method for approximating nonlinear transformations of Gaussian mixture random variables. It is based on transforming the individual Gaussians wi...
Friedrich Faubel, Dietrich Klakow
ALGORITHMICA
2007
82views more  ALGORITHMICA 2007»
15 years 6 months ago
Rigid Components in Molecular Graphs
In this paper we consider 3-dimensional generic bar-and-joint realizations of squares of graphs. These graphs are also called molecular graphs due to their importance in the study...
Bill Jackson, Tibor Jordán
ARSCOM
2007
82views more  ARSCOM 2007»
15 years 6 months ago
Extremal properties of (1, f)-odd factors in graphs
Let G be a simple graph and f : V (G) → {1, 3, 5, ...} an odd integer valued function defined on V (G). A spanning subgraph F of G is called a (1, f)odd factor if dF (v) ∈ {1...
Qinglin Roger Yu, Zhao Zhang
CC
2010
Springer
135views System Software» more  CC 2010»
15 years 6 months ago
Counting Irreducible Components of Complex Algebraic Varieties
Abstract. We present an algorithm for counting the irreducible components of a complex algebraic variety defined by a fixed number of polynomials encoded as straight-line programs ...
Peter Bürgisser, Peter Scheiblechner
CN
2010
103views more  CN 2010»
15 years 6 months ago
Resilient and survivable networks
This poster discusses methods to characterize the resilience of networks to a number of challenges and attacks, with the goal of developing quantifiable metrics to determine the de...
Bernhard Plattner, David Hutchison, James P. G. St...