Sciweavers

2200 search results - page 136 / 440
» Bloch's Constant is Computable
Sort
View
CORR
2006
Springer
84views Education» more  CORR 2006»
15 years 6 months ago
A Recursive Method for Determining the One-Dimensional Submodules of Laurent-Ore Modules
We present a method for determining the one-dimensional submodules of a Laurent-Ore module. The method is based on a correspondence between hyperexponential solutions of associate...
Ziming Li, Michael F. Singer, Min Wu, Dabin Zheng
EOR
2007
174views more  EOR 2007»
15 years 6 months ago
A Benders approach for the constrained minimum break problem
This paper presents a hybrid IP/CP algorithm for designing a double round robin schedule with a minimal number of breaks. Both mirrored and non-mirrored schedules with and without ...
Rasmus V. Rasmussen, Michael A. Trick
PRL
2006
153views more  PRL 2006»
15 years 6 months ago
Efficient adaptive density estimation per image pixel for the task of background subtraction
We analyze the computer vision task of pixel-level background subtraction. We present recursive equations that are used to constantly update the parameters of a Gaussian mixture m...
Zoran Zivkovic, Ferdinand van der Heijden
AUTOMATICA
2002
95views more  AUTOMATICA 2002»
15 years 6 months ago
Series expansions for analytic systems linear in control
This paper presents a series expansion for the evolution of a class of nonlinear systems characterized by constant input vector fields. We present a series expansion that can be c...
Francesco Bullo
IPL
2002
107views more  IPL 2002»
15 years 6 months ago
Binary space partitions for axis-parallel line segments: Size-height tradeoffs
We present worst-case lower bounds on the minimum size of a binary space partition (BSP) tree as a function of its height, for a set S of n axis-parallel line segments in the plan...
Sunil Arya