1136 search results - page 60 / 228 » Finding Small Holes |
ANLP
1997
13 years 10 months ago
1997
Statistical models of word-sense disambiguation are often based on a small number of contextual features or on a model that is assumed to characterize the interactions among a set...
WSC
1998
13 years 10 months ago
1998
Achieving the best possible cost performance for a system is often the goal of the manager of that system. This is true for large systems (such as an entire railroad system) as we...
COOTS
1996
13 years 10 months ago
1996
During the development of Beyond-Sniff, a distributed multi-user development platform, we were confronted with various, apparently unrelated problems: data, control, and user inte...
ARSCOM
2008
13 years 9 months ago
2008
A Greedy Defining Set is a set of entries in a Latin square with the property that when the square is systematically filled in with a greedy algorithm, the greedy algorithm succee...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
The problem of finding "small" sets that meet every straight-line which intersects a given convex region was initiated by Mazurkiewicz in 1916. We call such a set an opa...