发布求助
文献互助 智能选刊 最新文献

[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science最新文献

筛选
英文 中文
A new characterization of Mehlhorn's polynomial time functionals Mehlhorn多项式时间泛函的一个新表征
[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science Pub Date : 1991-09-01 DOI: 10.1109/SFCS.1991.185389
B. Kapron, S. Cook
{"title":"A new characterization of Mehlhorn's polynomial time functionals","authors":"B. Kapron, S. Cook","doi":"10.1109/SFCS.1991.185389","DOIUrl":"https://doi.org/10.1109/SFCS.1991.185389","url":null,"abstract":"A. Cobham (1964) presented a machine-independent characterization of computational feasibility, via inductive definition. R. Constable (1973) was apparently the first to consider the notion of feasibility for type 2 functionals. K. Mehlhorn's (1976) study of feasible reducibilities proceeds from Constable's work. Here, a class of polytime operators is defined, using a generalization of Cobham's definition. The authors provide an affirmative answer to the question of whether there is a natural machine based definition of Mehlhorn's class.<<ETX>>","PeriodicalId":320781,"journal":{"name":"[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122321056","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 21
On better heuristic for Euclidean Steiner minimum trees 欧几里得斯坦纳最小树的一种更好的启发式
[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science Pub Date : 1991-09-01 DOI: 10.1109/SFCS.1991.185402
D. Du, Yanjun Zhang, Qing Feng
{"title":"On better heuristic for Euclidean Steiner minimum trees","authors":"D. Du, Yanjun Zhang, Qing Feng","doi":"10.1109/SFCS.1991.185402","DOIUrl":"https://doi.org/10.1109/SFCS.1991.185402","url":null,"abstract":"Finding a shortest network interconnecting a given set of points in the Euclidean plane (a Steiner minimum tree) is known to be NP-hard. It is shown that there exists a polynomial-time heuristic with a performance ratio bigger than square root 3/2.<<ETX>>","PeriodicalId":320781,"journal":{"name":"[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126064438","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 71
Fat triangles determine linearly many holes (computational geometry) 胖三角形确定线性多孔(计算几何)
[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science Pub Date : 1991-09-01 DOI: 10.1109/SFCS.1991.185347
J. Matoušek, Nathaly Miller, J. Pach, M. Sharir, Shmuel Sifrony, E. Welzl
{"title":"Fat triangles determine linearly many holes (computational geometry)","authors":"J. Matoušek, Nathaly Miller, J. Pach, M. Sharir, Shmuel Sifrony, E. Welzl","doi":"10.1109/SFCS.1991.185347","DOIUrl":"https://doi.org/10.1109/SFCS.1991.185347","url":null,"abstract":"It is shown that for every fixed delta >0 the following holds: if F is a union of n triangles, all of whose angles are at least delta , then the complement of F has O(n) connected components, and the boundary of F consists of O(n log log n) segments. This latter complexity becomes linear if all triangles are of roughly the same size or if they are all infinite wedges. A randomized algorithm that computes F in expected time O(n2/sup alpha (n)/ log n) is given. Several applications of these results are presented.<<ETX>>","PeriodicalId":320781,"journal":{"name":"[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science","volume":"9 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116673637","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 15
Efficient algorithms for the Riemann-Roch problem and for addition in the Jacobian of a curve 求解Riemann-Roch问题和曲线雅可比矩阵加法的有效算法
[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science Pub Date : 1991-09-01 DOI: 10.1109/SFCS.1991.185435
Ming-Deh A. Huang, D. Ierardi
{"title":"Efficient algorithms for the Riemann-Roch problem and for addition in the Jacobian of a curve","authors":"Ming-Deh A. Huang, D. Ierardi","doi":"10.1109/SFCS.1991.185435","DOIUrl":"https://doi.org/10.1109/SFCS.1991.185435","url":null,"abstract":"Several computational problems concerning the construction of rational functions and intersecting curves over a given curve are studied. The first problem is to construct a rational function with prescribed zeros and poles over a given curve. More precisely, let C be a smooth projective curve and assume as given an affine plane model F(x,y)=0 for C, a finite set of points P/sub i/=(X/sub i/, Y/sub i/) with F (X/sub i/, Y/sub i/)=0 and natural numbers n/sub i/, and a finite set of points Q/sub i/=(X/sub j/, Y/sub j/) with F(X/sub j/, Y/sub j/)=0 and natural numbers m/sub j/. The problem is to decide whether there is a rational function which has zeros at each point P/sub i/ of order n/sub i/, poles at each Q/sub j/ of order m/sub j/, and no zeros or poles anywhere else on C. One would also like to construct such a rational function if one exists. An efficient algorithm for solving this problem when the given plane curve has only ordinary multiple points is given.<<ETX>>","PeriodicalId":320781,"journal":{"name":"[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125275690","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 58
Highly fault-tolerant sorting circuits 高度容错的分选电路
[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science Pub Date : 1991-09-01 DOI: 10.1109/SFCS.1991.185406
F. Leighton, Yuan Ma, C. Plaxton
{"title":"Highly fault-tolerant sorting circuits","authors":"F. Leighton, Yuan Ma, C. Plaxton","doi":"10.1109/SFCS.1991.185406","DOIUrl":"https://doi.org/10.1109/SFCS.1991.185406","url":null,"abstract":"The problem of constructing a sorting circuit that will work well even if a constant fraction of its comparators fail at random is addressed. Two types of comparator failure are considered: passive failures, which result in no comparison being made (i.e., the items being compared are output in the same order that they are input), and destructive failures, which result in the items being output in the reverse of the correct order. In either scenario, it is assumed that each comparator is faulty with some constant probability rho , and a circuit is said to be fault-tolerant if it performs some desired function with high probability given that each comparator fails with probability rho . One passive and two destructive circuits are constructed.<<ETX>>","PeriodicalId":320781,"journal":{"name":"[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122563189","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 19
The art gallery theorem for polygons with holes 带孔多边形的画廊定理
[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science Pub Date : 1991-09-01 DOI: 10.1109/SFCS.1991.185346
Frank Hoffmann, M. Kaufmann, K. Kriegel
{"title":"The art gallery theorem for polygons with holes","authors":"Frank Hoffmann, M. Kaufmann, K. Kriegel","doi":"10.1109/SFCS.1991.185346","DOIUrl":"https://doi.org/10.1109/SFCS.1991.185346","url":null,"abstract":"Art gallery problems which have been extensively studied over the last decade ask how to station a small (minimum) set of guards in a polygon such that every point of the polygon is watched by at least one guard. The graph-theoretic formulation and solution to the gallery problem for polygons in standard form is given. A complexity analysis is carried out, and open problems are discussed.<<ETX>>","PeriodicalId":320781,"journal":{"name":"[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science","volume":"120 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117297741","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 99
Faster uniquely represented dictionaries 更快的唯一表示字典
[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science Pub Date : 1991-09-01 DOI: 10.1109/SFCS.1991.185430
A. Andersson, T. Ottmann
{"title":"Faster uniquely represented dictionaries","authors":"A. Andersson, T. Ottmann","doi":"10.1109/SFCS.1991.185430","DOIUrl":"https://doi.org/10.1109/SFCS.1991.185430","url":null,"abstract":"The authors present a solution to the dictionary problem where each subset of size n of an ordered universe is represented by a unique structure, containing a (unique) binary search tree. The structure permits the execution of search, insert, and delete operations in O(n/sup 1/3/) time in the worst case. They also give a general lower bound, stating that for any unique representation of a set in a graph of, bounded outdegree, one of the operations search or update must require a cost of Omega (n/sup 1/3/) Therefore, the result sheds new light on previously claimed lower bounds for unique binary search tree representations.<<ETX>>","PeriodicalId":320781,"journal":{"name":"[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130106462","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 16
Optimal prefetching via data compression 通过数据压缩优化预取
[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science Pub Date : 1991-09-01 DOI: 10.1145/234752.234753
Jeerey Scott, Vitter P Krishnan, Jeerey Scott Vitter, P. Krishnan
{"title":"Optimal prefetching via data compression","authors":"Jeerey Scott, Vitter P Krishnan, Jeerey Scott Vitter, P. Krishnan","doi":"10.1145/234752.234753","DOIUrl":"https://doi.org/10.1145/234752.234753","url":null,"abstract":"A form of the competitive philosophy is applied to the problem of prefetching to develop an optimal universal prefetcher in terms of fault ratio, with particular applications to large-scale databases and hypertext systems. The algorithms are novel in that they are based on data compression techniques that are both theoretically optimal and good in practice. Intuitively, in order to compress data effectively, one has to be able to predict feature data well, and thus good data compressors should be able to predict well for purposes of prefetching. It is shown for powerful models such as Markov sources and mth order Markov sources that the page fault rates incurred by the prefetching algorithms presented are optimal in the limit for almost all sequences of page accesses.<<ETX>>","PeriodicalId":320781,"journal":{"name":"[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science","volume":"9 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121207230","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 227
Finding k-cuts within twice the optimal 在两倍的最优范围内找到k-cut
[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science Pub Date : 1991-09-01 DOI: 10.1109/SFCS.1991.185443
H. Saran, V. Vazirani
{"title":"Finding k-cuts within twice the optimal","authors":"H. Saran, V. Vazirani","doi":"10.1109/SFCS.1991.185443","DOIUrl":"https://doi.org/10.1109/SFCS.1991.185443","url":null,"abstract":"Two simple approximation algorithms are presented for the minimum k-cut problem. Each algorithm finds a k-cut having weight within a factor of (2-2/k) of the optimal. One of the algorithms is particularly efficient, requiring a total of only n-1 maximum flow computations for finding a set of near-optimal k-cuts, one for each value of k between 2 and n.<<ETX>>","PeriodicalId":320781,"journal":{"name":"[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128971559","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 263
Optimal file sharing in distributed networks 分布式网络中的最优文件共享
[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science Pub Date : 1991-09-01 DOI: 10.1109/SFCS.1991.185414
M. Naor, R. Roth
{"title":"Optimal file sharing in distributed networks","authors":"M. Naor, R. Roth","doi":"10.1109/SFCS.1991.185414","DOIUrl":"https://doi.org/10.1109/SFCS.1991.185414","url":null,"abstract":"Given a distributed network of processors represented by an undirected graph G=(V, E) and a file size k, the problem of distributing an arbitrary file w of k bits among all nodes of the network G is considered. Memory devices are to be assigned to the node of G such that, by accessing the memory of its own and of its adjacent nodes, each node can reconstruct the contents of w. The objective is to minimize the total size memory in the network. A file distribution scheme that realizes this objective for k>>log Delta /sub G/, where Delta /sub G/, stands for the maximum degree in G, is presented. For this range of k, the total size of memory required by the suggested scheme approaches an integer programming lower bound on that size.<<ETX>>","PeriodicalId":320781,"journal":{"name":"[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science","volume":"88 31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130784841","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 59
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信