2485 search results - page 279 / 497 » Time Bounded Frequency Computations |
CVPR
2007
IEEE
14 years 10 months ago
2007
IEEE
In this paper we introduce two new methods for solving binary quadratic problems. While spectral relaxation methods have been the workhorse subroutine for a wide variety of comput...
APPROX
2011
Springer
12 years 8 months ago
2011
Springer
This work considers locally decodable codes in the computationally bounded channel model. The computationally bounded channel model, introduced by Lipton in 1994, views the channe...
PODC
2006
ACM
14 years 2 months ago
2006
ACM
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
TIT
2002
13 years 7 months ago
2002
A novel DC-free binary convolutional coding scheme is presented. The proposed scheme achieves the DC-free and error correcting capability simultaneously. The scheme has a simple ca...
ECCC
2011
13 years 3 months ago
2011
We show two new direct product results in two different models of communication complexity. Our first result is in the model of one-way public-coin model. Let f ⊆ X × Y × Z ...