60 search results - page 9 / 12 » Lower bounds for designs in symmetric spaces |
GOSLER
1995
13 years 11 months ago
1995
In designing learning algorithms it seems quite reasonable to construct them in such a way that all data the algorithm already has obtained are correctly and completely reflected...
ALGORITHMICA
2008
13 years 7 months ago
2008
In this paper we investigate the design and analysis of algorithms resilient to memory faults. We focus on algorithms that, despite the corruption of some memory values during the...
ACL
2011
12 years 11 months ago
2011
Via an oracle experiment, we show that the upper bound on accuracy of a CCG parser is significantly lowered when its search space is pruned using a supertagger, though the supert...
JCB
2006
13 years 7 months ago
2006
Tree structures are useful for describing and analyzing biological objects and processes. Consequently, there is a need to design metrics and algorithms to compare trees. A natura...
SODA
2010
ACM
14 years 4 months ago
2010
ACM
We develop (single-pass) streaming algorithms for maintaining extent measures of a stream S of n points in Rd . We focus on designing streaming algorithms whose working space is p...