1995 search results - page 50 / 399 » What's the Problem |
118
Voted
ACL
2009
15 years 1 months ago
2009
We report in this paper our work on accurately generating case markers and suffixes in English-to-Hindi SMT. Hindi is a relatively free word-order language, and makes use of a com...
150
click to vote
Presentation
This presentation was given as part of theory seminars @ Dept of CSA, Indian Institute of Science, Bangalore. This talk explains about assignment problem and why mechanism design i...
141
Voted
ECCC
2011
14 years 7 months ago
2011
We study the following problem raised by von zur Gathen and Roche [GR97]: What is the minimal degree of a nonconstant polynomial f : {0, . . . , n} → {0, . . . , m}?
132
click to vote
CORR
2007
Springer
15 years 3 months ago
2007
Springer
There are several public key establishment protocols as well as complete public key cryptosystems based on allegedly hard problems from combinatorial (semi)group theory known by no...
100
Voted
ESA
2009
Springer
15 years 10 months ago
2009
Springer
Given n potential oil locations, where each has oil at a certain depth, we seek good trade-offs between the number of oil sources found and the total amount of drilling performed. ...