1368 search results - page 51 / 274 » Avoiding Simplicity Is Complex |
VL
2010
IEEE
13 years 8 months ago
2010
IEEE
Many dynamic programming language features, such as implicit declaration, reflection, and code generation, make it difficult to verify the existence of identifiers through standar...
NAACL
2010
13 years 7 months ago
2010
Machine translation benefits from two types of decoding techniques: consensus decoding over multiple hypotheses under a single model and system combination over hypotheses from di...
IC
2003
13 years 11 months ago
2003
Abstract— Marshaling or serialization of objects is an important component of both distributed and parallel computing. Current systems impose a significant burden on the program...
ACL
1993
13 years 11 months ago
1993
Overgeneration is the main source of computational complexity in previous principle-based parsers. This paper presents a message passing algorithm for principle-based parsing that...
ASPDAC
2005
ACM
13 years 12 months ago
2005
ACM
This paper proposes a novel O(n) Parallel Banker’s Algorithm (PBA) with a best-case run-time of O(1), reduced from an ¢¤£¦¥¨§© run-time complexity of the original Ban...