276 search results - page 14 / 56 » The Complexity of Computing Maximal Word Functions |
78
Voted
COLT
2000
Springer
15 years 4 months ago
2000
Springer
We study model selection strategies based on penalized empirical loss minimization. We point out a tight relationship between error estimation and data-based complexity penalizatio...
82
Voted
ACL
2010
14 years 9 months ago
2010
This work models Word Sense Disambiguation (WSD) problem as a Distributed Constraint Optimization Problem (DCOP). To model WSD as a DCOP, we view information from various knowledg...
IFIP13
2004
15 years 1 months ago
2004
: Function allocation, as a process used in the construction of dependable complex systems, is a significant aspect of the design and implementation of interactive systems. It invo...
112
click to vote
CANS
2010
Springer
14 years 9 months ago
2010
Springer
The SHA-3 competition organized by NIST [1] aims to find a new hash standard as a replacement of SHA-2. Till now, 14 submissions have been selected as the second round candidates, ...
MFCS
2001
Springer
15 years 4 months ago
2001
Springer
We describe a class of simple transitive semiautomata that exhibit full exponential blow-up during deterministic simulation. For arbitrary semiautomata we show that it is PSPACE-c...