5100 search results - page 211 / 1020 » The Linear Complexity of a Graph |
123
Voted
SIAMCOMP
2002
15 years 6 days ago
2002
Linear quantum cellular automata were introduced recently as one of the models of quantum computing. A basic postulate of quantum mechanics imposes a strong constraint on any quan...
101
Voted
CORR
2011
Springer
14 years 7 months ago
2011
Springer
—A system of linear dependent types for the lambda calculus with full higher-order recursion, called d PCF, is introduced and proved sound and relatively complete. Completeness h...
129
click to vote
STOC
2004
ACM
16 years 26 days ago
2004
ACM
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...
CVPR
2010
IEEE
15 years 9 months ago
2010
IEEE
The traditional SPM approach based on bag-of-features (BoF) must use nonlinear classifiers to achieve good image classification performance. This paper presents a simple but effec...
74
Voted
ETFA
2008
IEEE
15 years 7 months ago
2008
IEEE
The dater equalities constitute a well-known tool which allows the description of Timed Event Graphs in the field of (max, +) algebra. This paper gives an equivalent model in the...