3192 search results - page 477 / 639 » The minimum latency problem |
122
Voted
VLC
2008
15 years 28 days ago
2008
Recognizing hand-sketched symbols is a definitely complex problem. The input drawings are often intrinsically ambiguous, and require context to be interpreted in a correct way. Ma...
117
Voted
IJCM
2002
15 years 25 days ago
2002
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to...
110
click to vote
CORR
1998
Springer
15 years 22 days ago
1998
Springer
We address the problem of clustering words (or constructing a thesaurus) based on co-occurrence data, and using the acquired word classes to improve the accuracy of syntactic disa...
97
Voted
TIT
1998
15 years 21 days ago
1998
—We investigate a new class of codes for the optimal covering of vertices in an undirected graph Gsuch that any vertex in G can be uniquely identified by examining the vertices ...
TSMC
1998
15 years 21 days ago
1998
—Consider the problem of a robot (learning mechanism or algorithm) attempting to locate a point on a line. The mechanism interacts with a random environment which essentially inf...