15033 search results - page 121 / 3007 » Complexity Theory and Algorithms |
128
click to vote
ICML
1999
IEEE
16 years 4 months ago
1999
IEEE
Most machine learning algorithms share the following drawback: they only output bare predictions but not the con dence in those predictions. In the 1960s algorithmic information t...
115
click to vote
ACL
1994
15 years 5 months ago
1994
We show that more head-driven parsing algorithms can he formulated than those occurring in the existing literature. These algorithms are inspired by a family of left-to-right pars...
127
click to vote
STOC
2004
ACM
16 years 4 months ago
2004
ACM
We investigate the design of algorithms resilient to memory faults, i.e., algorithms that, despite the corruption of some memory values during their execution, are able to produce...
118
click to vote
COMPGEOM
2004
ACM
15 years 9 months ago
2004
ACM
We study the problem of computing the visibility graph defined by a set P of n points inside a polygon Q: two points p, q ∈ P are joined by an edge if the segment pq ⊂ Q. Ef...
145
click to vote
TCOM
2010
15 years 2 months ago
2010
—The optimal performance-complexity tradeoff for error-correcting codes at rates strictly below the Shannon limit is a central question in coding theory. This paper proposes a nu...