8695 search results - page 1673 / 1739 » Making the Complex Simple |
ICS
2010
Tsinghua U.
15 years 2 months ago
2010
Tsinghua U.
: We study the weight distribution and list-decoding size of Reed-Muller codes. Given a weight parameter, we are interested in bounding the number of Reed-Muller codewords with a w...
STOC
2010
ACM
15 years 2 months ago
2010
ACM
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...
140
Voted
AII
1992
15 years 2 months ago
1992
Most theoretical models of inductive inference make the idealized assumption that the data available to a learner is from a single and accurate source. The subject of inaccuracies ...
SIGGRAPH
1993
ACM
15 years 2 months ago
1993
ACM
An ideal visibility algorithm should a) quickly reject most of the hidden geometry in a model and b) exploit the spatial and perhaps temporal coherence of the images being generat...
SIGGRAPH
1993
ACM
15 years 2 months ago
1993
ACM
We present an efficient and robust algorithm for finding points of collision between time-dependent parametric and implicit surfaces. The algorithm detects simultaneous collisio...