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

[1993] The 2nd Israel Symposium on Theory and Computing Systems最新文献

筛选
英文 中文
Deterministic approximate counting of depth-2 circuits 深度2电路的确定性近似计数
[1993] The 2nd Israel Symposium on Theory and Computing Systems Pub Date : 1993-06-07 DOI: 10.1109/ISTCS.1993.253488
M. Luby, B. Velickovic, A. Wigderson
{"title":"Deterministic approximate counting of depth-2 circuits","authors":"M. Luby, B. Velickovic, A. Wigderson","doi":"10.1109/ISTCS.1993.253488","DOIUrl":"https://doi.org/10.1109/ISTCS.1993.253488","url":null,"abstract":"The authors describe deterministic algorithms which for a given depth-2 circuit F approximate the probability that on a random input F outputs a specific value alpha . The approach gives an algorithm which for a given GF(2) multivariate polynomial p and given in >0 approximates the number of zeros (or ones) of p within a multiplicative factor 1+ in . The algorithm runs in time exp(exp(O( square root log(n/ in )))), where n is the size of the circuit. They also obtain an algorithm which given a DNF formula F and in >0 approximates the number of satisfying assignments of F within a factor of 1+ in and runs in time exp(O((log(n/ in ))/sup 4/)).<<ETX>>","PeriodicalId":281109,"journal":{"name":"[1993] The 2nd Israel Symposium on Theory and Computing Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130956049","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}
引用次数: 79
Approximating bounded 0-1 integer linear programs 近似有界0-1整数线性规划
[1993] The 2nd Israel Symposium on Theory and Computing Systems Pub Date : 1993-06-07 DOI: 10.1109/ISTCS.1993.253482
D. Peleg, G. Schechtman, A. Wool
{"title":"Approximating bounded 0-1 integer linear programs","authors":"D. Peleg, G. Schechtman, A. Wool","doi":"10.1109/ISTCS.1993.253482","DOIUrl":"https://doi.org/10.1109/ISTCS.1993.253482","url":null,"abstract":"The problem of finding approximate solutions for a subclass of 0-1 integer linear programming denoted by I L P(k,p) is considered. The problem involves finding X in","PeriodicalId":281109,"journal":{"name":"[1993] The 2nd Israel Symposium on Theory and Computing Systems","volume":"95 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114264198","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}
引用次数: 29
Algorithmic research problems in molecular bioinformatics 分子生物信息学中的算法研究问题
[1993] The 2nd Israel Symposium on Theory and Computing Systems Pub Date : 1993-06-07 DOI: 10.1109/ISTCS.1993.253471
Thomas Lengauer
{"title":"Algorithmic research problems in molecular bioinformatics","authors":"Thomas Lengauer","doi":"10.1109/ISTCS.1993.253471","DOIUrl":"https://doi.org/10.1109/ISTCS.1993.253471","url":null,"abstract":"The large amounts of data being assembled in the genome sequencing projects provide a grand challenge to science, namely their interpretation. There are several aspects to this interpretation such as identifying genes, determining the structure of the encoded proteins, discovering the mechanisms, by which proteins execute their biological function, and gaining insights into what role noncoding regions of the DNA play in gene regularization and expression, as well as metabolism. Due to the increased computing power and, especially, due to sophisticated graphics technology, one can visualize the structure and dynamics of molecules on the computer screen. What is still largely missing is a set of reliable models and algorithmic methods for deriving molecular structures on the basis of sequence data, as well as methods for the reliable prediction and analysis of interactions between biomolecules such as enzymes and their substrates. The author points out a few problems for which careful modeling and the development of appropriate algorithmic techniques is at the center of progress in computer-aided molecular biology.<<ETX>>","PeriodicalId":281109,"journal":{"name":"[1993] The 2nd Israel Symposium on Theory and Computing Systems","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126772778","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}
引用次数: 24
One-way functions are essential for non-trivial zero-knowledge 单向函数对于非平凡零知识是必不可少的
[1993] The 2nd Israel Symposium on Theory and Computing Systems Pub Date : 1993-06-07 DOI: 10.1109/ISTCS.1993.253489
R. Ostrovsky, A. Wigderson
{"title":"One-way functions are essential for non-trivial zero-knowledge","authors":"R. Ostrovsky, A. Wigderson","doi":"10.1109/ISTCS.1993.253489","DOIUrl":"https://doi.org/10.1109/ISTCS.1993.253489","url":null,"abstract":"If one-way functions exist, then there are zero-knowledge proofs for every language in PSPACE. The authors prove that unless very weak one-way functions exist, zero-knowledge proofs can be given only for languages in BPP. For average-case definitions of BPP they prove an analogous result under the assumption that uniform one-way functions do not exist. Thus, very loosely speaking, zero-knowledge is either useless (exists only for 'easy' languages), or universal (exists for every provable language).<<ETX>>","PeriodicalId":281109,"journal":{"name":"[1993] The 2nd Israel Symposium on Theory and Computing Systems","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128647436","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}
引用次数: 165
Structured design of self-stabilizing programs 自稳定程序的结构化设计
[1993] The 2nd Israel Symposium on Theory and Computing Systems Pub Date : 1993-06-07 DOI: 10.1109/ISTCS.1993.253472
F. Stomp
{"title":"Structured design of self-stabilizing programs","authors":"F. Stomp","doi":"10.1109/ISTCS.1993.253472","DOIUrl":"https://doi.org/10.1109/ISTCS.1993.253472","url":null,"abstract":"Much effort has been invested in recent years to propose self-stabilizing programs for various purposes. Only little attention has been paid to the structured, formal design and verification of such programs. The current paper presents a sound and formal principle for designing, hence verifying self-stabilizing programs. This principle, which combines programs into larger ones, is formulated in linear time temporal logic and captures the underlying intuition of many designers of self-stabilizing programs in a natural way. The proposed principle is applied to a program, due to Ghosh and Karaata (1991), for coloring a graph.<<ETX>>","PeriodicalId":281109,"journal":{"name":"[1993] The 2nd Israel Symposium on Theory and Computing Systems","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115620599","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}
引用次数: 22
A lower bound for linear approximate compaction 线性近似压实的下界
[1993] The 2nd Israel Symposium on Theory and Computing Systems Pub Date : 1993-06-07 DOI: 10.1109/ISTCS.1993.253487
S. Chaudhuri
{"title":"A lower bound for linear approximate compaction","authors":"S. Chaudhuri","doi":"10.1109/ISTCS.1993.253487","DOIUrl":"https://doi.org/10.1109/ISTCS.1993.253487","url":null,"abstract":"The lambda -approximate compaction problem is: given an input array of n values, each either 0 or 1, place each value in the output array so that all the 1s are in the first (1+ lambda )k array locations, where k is the number of 1's in the input. lambda is an accuracy parameter. This problem is of fundamental importance in parallel computation because of its applications to processor allocation and approximate counting. When lambda is a constant, the problem is called linear approximate compaction (LAC). On the CRCW PRAM model, there is an algorithm that solves approximate compaction in O((log log n)/sup 3/) time for lambda =/sup 1///sub loglogn/, using /sup n///sub (loglogn)3/ processors. This is close to the best possible. Specifically, the authors, prove that LAC requires Omega (log log n) time using O(n) processors. They also give a tradeoff between lambda and the processing time. For in <1, and lambda =n/sup in /, the time required is Omega (log/sup 1///sub in /).<<ETX>>","PeriodicalId":281109,"journal":{"name":"[1993] The 2nd Israel Symposium on Theory and Computing Systems","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133539473","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}
引用次数: 6
Interactive proofs and approximation: reductions from two provers in one round 交互证明和近似:一轮两个证明者的约简
[1993] The 2nd Israel Symposium on Theory and Computing Systems Pub Date : 1993-06-07 DOI: 10.1109/ISTCS.1993.253462
M. Bellare
{"title":"Interactive proofs and approximation: reductions from two provers in one round","authors":"M. Bellare","doi":"10.1109/ISTCS.1993.253462","DOIUrl":"https://doi.org/10.1109/ISTCS.1993.253462","url":null,"abstract":"The author presents hard to approximate problems in the following areas: systems of representatives, network flow, and longest paths in graphs. In each case he shows that there exists some delta >0 such that polynomial time approximation to within a factor of 2/sup log delta n/ of the optimal implies that NP has quasi polynomial time deterministic simulations. The results are derived by reduction from two prover, one round proof systems, and exemplify the ability of such reductions to yield hardness of approximations results for many different kinds of problems.<<ETX>>","PeriodicalId":281109,"journal":{"name":"[1993] The 2nd Israel Symposium on Theory and Computing Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132423750","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}
引用次数: 36
Finding the neighborhood of a query in a dictionary 在字典中查找查询的邻域
[1993] The 2nd Israel Symposium on Theory and Computing Systems Pub Date : 1993-06-07 DOI: 10.1109/ISTCS.1993.253486
D. Dolev, Y. Harari, Michal Parnas
{"title":"Finding the neighborhood of a query in a dictionary","authors":"D. Dolev, Y. Harari, Michal Parnas","doi":"10.1109/ISTCS.1993.253486","DOIUrl":"https://doi.org/10.1109/ISTCS.1993.253486","url":null,"abstract":"Many applications require the retrieval of all words from a fixed dictionary D, that are 'close' to some input string. The paper defines a theoretical framework to study the performance of algorithms for this problem, and provides a basic algorithmic approach. It is shown that a certain class of algorithms, D-oblivious algorithms, can not be optimal both in space and time. This is done by proving a lower bound on the tradeoff between the space and time complexities of D-oblivious algorithms. Several algorithms for this problem are presented, and their performance is compared to that of Ispell, the standard speller of Unix. On the Webster English dictionary the algorithms are shown to be faster than 'Ispell' by a significant factor, while incurring only a small cost in space.<<ETX>>","PeriodicalId":281109,"journal":{"name":"[1993] The 2nd Israel Symposium on Theory and Computing Systems","volume":"126 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126797228","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}
引用次数: 20
The minimum reservation rate problem in digital audio/video systems 数字音视频系统中的最小预订率问题
[1993] The 2nd Israel Symposium on Theory and Computing Systems Pub Date : 1993-06-07 DOI: 10.1109/ISTCS.1993.253485
N. Megiddo, M. Naor, David P. Anderson
{"title":"The minimum reservation rate problem in digital audio/video systems","authors":"N. Megiddo, M. Naor, David P. Anderson","doi":"10.1109/ISTCS.1993.253485","DOIUrl":"https://doi.org/10.1109/ISTCS.1993.253485","url":null,"abstract":"The minimum reservation rate problem arises in distributed systems for handling digital audio and video data. The problem is to find the minimum rate at which data must be reserved on a shared storage system in order to provide continuous buffered play-back of a variable-rate output schedule. The problem is equivalent to the minimum output rate: given input rates during various time periods, find the minimum output rate under which the buffer never overflows. The authors present an O(n log n) randomized algorithm and an O(n log n log log n) deterministic one.<<ETX>>","PeriodicalId":281109,"journal":{"name":"[1993] The 2nd Israel Symposium on Theory and Computing Systems","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134373557","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}
引用次数: 5
Subpixel image registration using circular fiducials 使用圆形基准的亚像素图像配准
[1993] The 2nd Israel Symposium on Theory and Computing Systems Pub Date : 1993-06-07 DOI: 10.1109/ISTCS.1993.253484
A. Efrat, C. Gotsman
{"title":"Subpixel image registration using circular fiducials","authors":"A. Efrat, C. Gotsman","doi":"10.1109/ISTCS.1993.253484","DOIUrl":"https://doi.org/10.1109/ISTCS.1993.253484","url":null,"abstract":"The design of fiducials for precise image registration is of major practical importance in computer vision, especially in automatic inspection applications. The authors analyze the subpixel registration accuracy that can, and cannot, be achieved by some rotation-invariant fiducials, and present and analyze efficient algorithms for the registration procedure. They rely on some old and new results from lattice geometry and number theory and efficient computational-geometric algorithms.<<ETX>>","PeriodicalId":281109,"journal":{"name":"[1993] The 2nd Israel Symposium on Theory and Computing Systems","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125429142","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}
引用次数: 30
首页 上一页 下一页 尾页
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学术文献互助群
群 号：604180095
Book学术官方微信
小红书