6274 search results - page 53 / 1255 » From query complexity to computational complexity |
COLING
1992
13 years 11 months ago
1992
The main problem arising from the use of complex constraints in Computational Linguists is due to the NP-hardness of checking whether a given set of constraints is satisfiable and...
LICS
2012
IEEE
12 years 10 days ago
2012
IEEE
—We show how to reliably compute fast-growing functions with timed-arc Petri nets and data nets. This construction provides ordinal-recursive lower bounds on the complexity of th...
ICPR
2008
IEEE
14 years 4 months ago
2008
IEEE
This paper proposes a method for constructing a discriminative rotation invariant object recognition system from the set of complex moments by using a multi-class boosting algorit...
IWCM
2004
Springer
14 years 3 months ago
2004
Springer
Abstract Image sequence processing techniques are an essential tool for the experimental investigation of dynamical processes such as exchange, growth, and transport processes. The...
IDEAS
2003
IEEE
14 years 3 months ago
2003
IEEE
This paper presents a method for representing uncertainty in spatial data in a database. The model presented requires moderate amounts of storage space. To compute the probability...