Sciweavers

1523 search results - page 105 / 305
» The Computational Complexity of Linear Optics
Sort
View
HCI
2009
13 years 6 months ago
Ensemble SWLDA Classifiers for the P300 Speller
Abstract. The P300 Speller has proven to be an effective paradigm for braincomputer interface (BCI) communication. Using this paradigm, studies have shown that a simple linear clas...
Garett D. Johnson, Dean J. Krusienski
PODS
2010
ACM
306views Database» more  PODS 2010»
14 years 2 months ago
Optimizing linear counting queries under differential privacy
Differential privacy is a robust privacy standard that has been successfully applied to a range of data analysis tasks. But despite much recent work, optimal strategies for answe...
Chao Li, Michael Hay, Vibhor Rastogi, Gerome Mikla...
ENTCS
2008
103views more  ENTCS 2008»
13 years 9 months ago
Analyzing Reachability for Some Petri Nets With Fast Growing Markings
Using linear algebraic techniques, we analyse the computational complexity of testing reachability in Petri nets for which markings can grow very fast. This leads to two subclasse...
M. Praveen, Kamal Lodaya
CORR
2008
Springer
130views Education» more  CORR 2008»
13 years 9 months ago
Convex Hull of Arithmetic Automata
Abstract. Arithmetic automata recognize infinite words of digits denoting decompositions of real and integer vectors. These automata are known expressive and efficient enough to re...
Jérôme Leroux
AUTOMATICA
2004
122views more  AUTOMATICA 2004»
13 years 8 months ago
Approximate explicit receding horizon control of constrained nonlinear systems
An algorithm for the construction of an explicit piecewise linear state feedback approximation to nonlinear constrained receding horizon control is given. It allows such controlle...
Tor Arne Johansen