5052 search results - page 19 / 1011 » On the Complexity of Ordered Colorings |
ICDE
2007
IEEE
14 years 9 months ago
2007
IEEE
Algorithms that exploit sort orders are widely used to implement joins, grouping, duplicate elimination and other set operations. Query optimizers traditionally deal with sort ord...
ILP
2003
Springer
14 years 1 months ago
2003
Springer
We study several complexity parameters for first order formulas and their suitability for first order learning models. We show that the standard notion of size is not captured by...
CVPR
2007
IEEE
2007
IEEE
Leveraging temporal, contextual and ordering constraints for recognizing complex activities in video
14 years 10 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...
MFCS
2005
Springer
14 years 1 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...
ESANN
2007
13 years 10 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...