|
Tijdschrift beschrijving
Alle jaargangen van het bijbehorende tijdschrift
Alle afleveringen van het bijbehorende jaargang
Alle artikelen van de bijbehorende aflevering
21 gevonden resultaten
| nr | titel | auteur | tijdschrift | jaar | jaarg. | afl. | pagina('s) | type |
| 1 | A Constant-Factor Approximation Algorithm for thek-MST Problem |
Blum, Avrim |
1999 |
58 | 1 |
p. 101-108 8 p. |
artikel |
|
| 2 | Analysis of Practical Backoff Protocols for Contention Resolution with Multiple Servers |
Goldberg, Leslie Ann |
1999 |
58 | 1 |
p. 232-258 27 p. |
artikel |
|
| 3 | A Note on the Influence of anε-Biased Random Source |
Ben-Dor, Amir |
1999 |
58 | 1 |
p. 174-176 3 p. |
artikel |
|
| 4 | Answering Queries Using Limited External Query Processors |
Levy, Alon Y. |
1999 |
58 | 1 |
p. 69-82 14 p. |
artikel |
|
| 5 | A Self-Stabilizing Distributed Algorithm to Find the Median of a Tree Graph |
Antonoiu, Gheorghe |
1999 |
58 | 1 |
p. 215-221 7 p. |
artikel |
|
| 6 | Characterizing Linear Size Circuits in Terms of Privacy |
Kushilevitz, Eyal |
1999 |
58 | 1 |
p. 129-136 8 p. |
artikel |
|
| 7 | Combining Fuzzy Information from Multiple Systems |
Fagin, Ronald |
1999 |
58 | 1 |
p. 83-99 17 p. |
artikel |
|
| 8 | Deciding the Vapnik–Červonenkis Dimension is∑p 3 -complete |
Schaefer, Marcus |
1999 |
58 | 1 |
p. 177-182 6 p. |
artikel |
|
| 9 | EDITOR'S FOREWORD |
Hull, Richard |
1999 |
58 | 1 |
p. iv- 1 p. |
artikel |
|
| 10 | EDITORS' FOREWORD |
Henzinger, Monika R. |
1999 |
58 | 1 |
p. 100- 1 p. |
artikel |
|
| 11 | Extracting Randomness: A Survey and New Constructions |
Nisan, Noam |
1999 |
58 | 1 |
p. 148-173 26 p. |
artikel |
|
| 12 | Managing Conflicts between Rules |
Jagadish, H.V. |
1999 |
58 | 1 |
p. 13-28 16 p. |
artikel |
|
| 13 | Maximal Machine Learnable Classes |
Case, John |
1999 |
58 | 1 |
p. 211-214 4 p. |
artikel |
|
| 14 | Mining Optimized Association Rules for Numeric Attributes |
Fukuda, Takeshi |
1999 |
58 | 1 |
p. 1-12 12 p. |
artikel |
|
| 15 | On the Boosting Ability of Top–Down Decision Tree Learning Algorithms |
Kearns, Michael |
1999 |
58 | 1 |
p. 109-128 20 p. |
artikel |
|
| 16 | On the Learnability of Rich Function Classes |
Ratsaby, Joel |
1999 |
58 | 1 |
p. 183-192 10 p. |
artikel |
|
| 17 | Paging against a Distribution and IP Networking |
Lund, Carsten |
1999 |
58 | 1 |
p. 222-231 10 p. |
artikel |
|
| 18 | Polynomial Time Approximation Schemes for Dense Instances of N P -Hard Problems |
Arora, Sanjeev |
1999 |
58 | 1 |
p. 193-210 18 p. |
artikel |
|
| 19 | Temporal Connectives versus Explicit Timestamps to Query Temporal Databases |
Abiteboul, Serge |
1999 |
58 | 1 |
p. 54-68 15 p. |
artikel |
|
| 20 | The Space Complexity of Approximating the Frequency Moments |
Alon, Noga |
1999 |
58 | 1 |
p. 137-147 11 p. |
artikel |
|
| 21 | Topological Queries in Spatial Databases |
Papadimitriou, CH. |
1999 |
58 | 1 |
p. 29-53 25 p. |
artikel |
21 gevonden resultaten