Sciweavers

4248 search results - page 330 / 850
» Simulating hci for all
Sort
View
CORR
2008
Springer
74views Education» more  CORR 2008»
15 years 7 months ago
Analysis of the Karmarkar-Karp Differencing Algorithm
The Karmarkar-Karp differencing algorithm is the best known polynomial time heuristic for the number partitioning problem, fundamental in both theoretical computer science and stat...
Stefan Boettcher, Stephan Mertens
CORR
2008
Springer
98views Education» more  CORR 2008»
15 years 7 months ago
On the inner and outer bounds for 2-receiver discrete memoryless broadcast channels
We study the best known general inner bound[1] and outer bound[2] for the capacity region of the two user discrete memory less channel. We prove that a seemingly stronger outer bou...
Chandra Nair, Zizhou Vincent Wang
CSDA
2008
89views more  CSDA 2008»
15 years 7 months ago
Projection density estimation under a m-sample semiparametric model
An m-sample semiparametric model in which the ratio of m - 1 probability density functions with respect to the mth is of a known parametric form without reference to any parametri...
Jean-Baptiste Aubin, Samuela Leoni-Aubin
ENDM
2010
130views more  ENDM 2010»
15 years 7 months ago
Experimental Analysis of an Online Trading Algorithm
Trading decisions in financial markets can be supported by the use of online algorithms. We evaluate the empirical performance of a threat-based online algorithm and compare it to...
Günter Schmidt, Esther Mohr, Mike Kersch
AUTOMATICA
2006
109views more  AUTOMATICA 2006»
15 years 7 months ago
Closed-loop subspace identification using the parity space
It is known that many subspace algorithms give biased estimates for closed-loop data due to the existence of feedback. In this paper we present a new subspace identification metho...
Jin Wang, S. Joe Qin