1139 search results - page 35 / 228 » Bounded Ideation Theory |
118
click to vote
SGP
2007
15 years 6 months ago
2007
We present two methods for lossy compression of normal vectors through quantization using "base" polyhedra. The first revisits subdivision-based quantization. The second...
115
click to vote
NIPS
2001
15 years 5 months ago
2001
The rule-based bootstrapping introduced by Yarowsky, and its cotraining variant by Blum and Mitchell, have met with considerable empirical success. Earlier work on the theory of c...
147
Voted
COMBINATORICS
2006
15 years 4 months ago
2006
Abstract. The geometric thickness of a graph G is the minimum integer k such that there is a straight line drawing of G with its edge set partitioned into k plane subgraphs. Eppste...
126
click to vote
ECCC
2007
15 years 4 months ago
2007
We recover the first linear programming bound of McEliece, Rodemich, Rumsey, and Welch for binary error-correcting codes and designs via a covering argument. It is possible to sh...
143
Voted
EMSOFT
2005
Springer
15 years 9 months ago
2005
Springer
This paper is about the modular compilation and distribution of a sub-class of Simulink programs [9] across networks using bounded FIFO queues. The problem is first addressed mat...