4378 search results - page 17 / 876 » On the Complexity of Ordered Colourings |
141
click to vote
CVPR
2007
IEEE
2007
IEEE
Leveraging temporal, contextual and ordering constraints for recognizing complex activities in video
16 years 8 months ago
We present a scalable approach to recognizing and describing complex activities in video sequences. We are interested in long-term, sequential activities that may have several par...
152
click to vote
MFCS
2005
Springer
15 years 11 months ago
2005
Springer
This paper analyses the computational complexity of the model checking problem for Higher Order Fixpoint Logic – the modal µ-calculus enriched with a typed λ-calculus. It is ha...
183
click to vote
ESANN
2007
15 years 7 months ago
2007
Any order parameter quantifying the degree of organisation in a physical system can be studied in connection to source extraction algorithms. Independent component analysis (ICA) b...
164
click to vote
ILP
2004
Springer
15 years 11 months ago
2004
Springer
Random forest induction is a bagging method that randomly samples the feature set at each node in a decision tree. In propositional learning, the method has been shown to work well...
161
click to vote
ICALP
2001
Springer
15 years 10 months ago
2001
Springer
We consider the quantum complexities of the following three problems: searching an ordered list, sorting an un-ordered list, and deciding whether the numbers in a list are all dis...