1220 search results - page 196 / 244 » Restricting grammatical complexity |
LATIN
2010
Springer
13 years 6 months ago
2010
Springer
The packet routing problem, i.e., the problem to send a given set of unit-size packets through a network on time, belongs to one of the most fundamental routing problems with impor...
MT
2010
13 years 6 months ago
2010
Phrase-based decoding is conceptually simple and straightforward to implement, at the cost of drastically oversimplified reordering models. Syntactically aware models make it pos...
SAGT
2010
Springer
13 years 6 months ago
2010
Springer
Can learning algorithms find a Nash equilibrium? This is a natural question for several reasons. Learning algorithms resemble the behavior of players in many naturally arising gam...
SPIRE
2010
Springer
13 years 6 months ago
2010
Springer
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
TRUSTBUS
2010
Springer
13 years 6 months ago
2010
Springer
: Context-Aware Privacy Design Pattern Selection Siani Pearson, Yun Shen HP Laboratories HPL-2010-74 Privacy, Design Patterns, Context Awareness User-related contextual factors...