简介
This volume contains papers presented at the Third International Conference on Computing and Information, ICCI '91, held at Carleton University in Ottawa, Canada, May 27-29, 1991. The conference was organized by the School of Computer Science at Carleton University, and was sponsored by the Natural Sciences and Engineering Research Council of Canada (NSERC) and Carleton University. ICCI '91 was an international forum for the presentation of original results in research, development, and applications in computing and information processing. The conference was aimed at both practitioners and theoreticians, and was organized into five streams: - Algorithms and complexity, - Databases and information systems, - Parallel processing and systems, - Distributed computing and systems, - Expert systems, artificial intelligence. This volume contains three invited papers, by E.C.R. Hehner, R.L. Probert, and S.J. Smith, and 71 selected papers.
目录
Front Matter
Pages -
Download PDF
(347KB)
Book Chapter
Pages 1-23
What's wrong with formal programming methods?
Book Chapter
Pages 24-32
Computer Science and communications protocols: Research relationships
Book Chapter
Pages 33-42
Reaping the benefits of mass production with massively parallel computing
Book Chapter
Pages 43-46
On the quickest path problem
Book Chapter
Pages 47-54
Practical adaptive sorting
Book Chapter
Pages 55-65
Lower bounds for algebraic computation trees of functions with finite domains
Book Chapter
Pages 66-77
Approximation algorithms for the Bandwidth Minimization Problem for a large class of trees
Book Chapter
Pages 78-89
The Interpolation-Based Bintree and its application to graphics
Book Chapter
Pages 90-101
On the k-coloring of intervals
Book Chapter
Pages 102-110
Folding a triangulated simple polygon: Structural and algorithmic results
Book Chapter
Pages 111-116
A relationship between self-organizing lists and binary search trees
Book Chapter
Pages 117-126
How costly can red-black trees be?
Book Chapter
Pages 127-133
Balance in AVL trees
Book Chapter
Pages 134-138
A tight lower bound for selection in sorted X+Y
Book Chapter
Pages 139-148
Greedy triangulation approximates the optimum and can be implemented in linear time in the average case
Book Chapter
Pages 149-160
Generating random graphs efficiently
Book Chapter
Pages 161-168
Linear extensions with backtracking
Book Chapter
Pages 169-180
Storing shortest paths for a polyhedron
Book Chapter
Pages 181-184
An improved join dependency for efficient constraint checking
Book Chapter
Pages 185-196
On the power of query-independent compilation Jiawei Han…show all 1hide Look Inside Get AccesspreviousPage
is not a valid page number. Please enter a number between
1and
4of
4
- 名称
- 类型
- 大小
光盘服务联系方式: 020-38250260 客服QQ：4006604884
云图客服：
用户发送的提问，这种方式就需要有位在线客服来回答用户的问题，这种 就属于对话式的,问题是这种提问是否需要用户登录才能提问
Video Player
×
Audio Player
×
pdf Player
×
