740 search results - page 91 / 148 » Lower bounds for Buchsbaum* complexes |
170
click to vote
FOCS
1995
IEEE
15 years 9 months ago
1995
IEEE
Abstract. Littlestone developed a simple deterministic on-line learning algorithm for learning k-literal disjunctions. This algorithm (called Winnow) keeps one weight for each of t...
169
click to vote
SPAA
2009
ACM
16 years 3 months ago
2009
ACM
Abstract. At-most-once semantics is one of the standard models for object access in decentralized systems. Accessing an object, such as altering the state of the object by means of...
186
click to vote
FOCS
1999
IEEE
15 years 10 months ago
1999
IEEE
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
153
click to vote
COCO
2009
Springer
16 years 23 days ago
2009
Springer
Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. There is a significant ...
170
click to vote
TWC
2008
15 years 6 months ago
2008
Carrier frequency synchronization is critical to the quality of signal reception in OFDM systems. This paper presents an approximate maximum-likelihood (ML) carrier frequency offse...