740 search results - page 69 / 148 » Lower bounds for Buchsbaum* complexes |
COMPGEOM
2006
ACM
15 years 5 months ago
2006
ACM
The k-means method is an old but popular clustering algorithm known for its observed speed and its simplicity. Until recently, however, no meaningful theoretical bounds were known...
STOC
2002
ACM
16 years 5 days ago
2002
ACM
: This paper gives two distinct proofs of an exponential separation between regular resolution and unrestricted resolution. The previous best known separation between these systems...
JALC
2007
14 years 11 months ago
2007
In this paper, we consider the enumeration of context-free languages. In particular, for any reasonable descriptional complexity measure for context-free grammars, we demonstrate ...
104
click to vote
TIT
1998
14 years 11 months ago
1998
—A sequential decoder for linear block codes that performs maximum-likelihood soft-decision decoding is described. The decoder uses a metric computed from a lower bound on the co...
ICCAD
2010
IEEE
14 years 10 months ago
2010
IEEE
Elastic systems, either synchronous or asynchronous, can be optimized for the average-case performance when they have units with early evaluation or variable latency. The performan...