164 search results - page 23 / 33 » Improved upper bounds on sizes of codes |
EWCBR
2006
Springer
15 years 1 months ago
2006
Springer
Feature selection for unsupervised tasks is particularly challenging, especially when dealing with text data. The increase in online documents and email communication creates a nee...
73
Voted
COMPGEOM
2005
ACM
14 years 11 months ago
2005
ACM
Order Type Extension and New Results ectilinear Crossing Number - Extended Abstract Oswin Aichholzer∗ Hannes Krasser† We provide a complete data base of all realizable order t...
98
Voted
ACL
1996
14 years 10 months ago
1996
In this paper 1 we present a new parsing algorithm for linear indexed grammars (LIGs) in the same spirit as the one described in (Vijay-Shanker and Weir, 1993) for tree adjoining ...
AROBOTS
2004
2004
Propagation of Uncertainty in Cooperative Multirobot Localization: Analysis and Experimental Results
14 years 9 months ago
This paper examines the problem of cooperative localization for the case of large groups of mobile robots. A Kalman filter estimator is implemented and tested for this purpose. The...
ISCA
1992
IEEE
15 years 1 months ago
1992
IEEE
As multiprocessor sizes scale and computer architects turn to interconnection networks with non-uniform communication latencies, the lure of exploiting communication locality to i...