522 search results - page 20 / 105 » On the Hardness of the Noncommutative Determinant |
IWANN
2005
Springer
14 years 1 months ago
2005
Springer
The Shortest Common Supersequence problem is a hard combinatorial optimization problem with numerous practical applications. Several evolutionary approaches are proposed for this p...
AAAI
2007
13 years 10 months ago
2007
Uncertainty arises in preference aggregation in several ways. There may, for example, be uncertainty in the votes or the voting rule. Such uncertainty can introduce computational ...
NAACL
2003
13 years 9 months ago
2003
We present a neural network method for inducing representations of parse histories and using these history representations to estimate the probabilities needed by a statistical le...
JUCS
2006
13 years 7 months ago
2006
: The size and complexity of software systems are continuously increasing, which makes them difficult and labor-intensive to develop, test and evolve. Since concurrent systems are ...
IEEEVAST
2010
13 years 2 months ago
2010
Data sets that contain geospatial and temporal elements can be challenging to analyze. In particular, it can be difficult to determine how the data have changed over spatial and t...