Sciweavers

5100 search results - page 210 / 1020
» The Linear Complexity of a Graph
Sort
View
STOC
1996
ACM
118views Algorithms» more  STOC 1996»
15 years 4 months ago
Characterizing Linear Size Circuits in Terms of Privacy
In this paper we prove a perhaps unexpected relationship between the complexity class of the boolean functions that have linear size circuits, and n-party private protocols. Speci...
Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosé...
106
Voted
CDC
2010
IEEE
119views Control Systems» more  CDC 2010»
14 years 7 months ago
Event-triggered output feedback control of finite horizon discrete-time multi-dimensional linear processes
Event-triggered control systems are systems in which the control signal is recomputed when the plant's output signal leaves a triggering-set. There has been recent interest in...
Lichun Li, Michael Lemmon
PR
2008
129views more  PR 2008»
15 years 15 days ago
A comparison of generalized linear discriminant analysis algorithms
7 Linear discriminant analysis (LDA) is a dimension reduction method which finds an optimal linear transformation that maximizes the class separability. However, in undersampled p...
Cheong Hee Park, Haesun Park
116
Voted
DEXAW
2008
IEEE
119views Database» more  DEXAW 2008»
15 years 7 months ago
Evolutionary Approaches to Linear Ordering Problem
Linear Ordering Problem (LOP) is a well know optimization problem attractive for its complexity (it is a NPhard problem), rich collection of testing data and variety of real world...
Václav Snásel, Pavel Krömer, Ja...
108
Voted
CSL
2010
Springer
15 years 1 months ago
Formal Theories for Linear Algebra
We introduce two-sorted theories in the style of [CN10] for the complexity classes L and DET, whose complete problems include determinants over Z2 and Z, respectively. We then desc...
Stephen Cook, Lila Fontes