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

International Workshop Randomization and Approximation Techniques in Computer Science最新文献

筛选
英文 中文
Random Geometric Problems on [0, 1]² [0,1]²上的随机几何问题
International Workshop Randomization and Approximation Techniques in Computer Science Pub Date : 1998-10-08 DOI: 10.1007/3-540-49543-6_23
J. Díaz, Jordi Petit, M. Serna
{"title":"Random Geometric Problems on [0, 1]²","authors":"J. Díaz, Jordi Petit, M. Serna","doi":"10.1007/3-540-49543-6_23","DOIUrl":"https://doi.org/10.1007/3-540-49543-6_23","url":null,"abstract":"","PeriodicalId":423704,"journal":{"name":"International Workshop Randomization and Approximation Techniques in Computer Science","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126455052","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}
引用次数: 34
Sampling Methods Applied to Dense Instances of Non-Boolean Optimization Problems 非布尔优化问题密集实例的抽样方法
International Workshop Randomization and Approximation Techniques in Computer Science Pub Date : 1998-10-08 DOI: 10.1007/3-540-49543-6_28
G. Andersson, Lars Engebretsen
{"title":"Sampling Methods Applied to Dense Instances of Non-Boolean Optimization Problems","authors":"G. Andersson, Lars Engebretsen","doi":"10.1007/3-540-49543-6_28","DOIUrl":"https://doi.org/10.1007/3-540-49543-6_28","url":null,"abstract":"","PeriodicalId":423704,"journal":{"name":"International Workshop Randomization and Approximation Techniques in Computer Science","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128793709","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
A Note on Bounding the Mixing Time by Linear Programming 关于用线性规划限定混合时间的注记
International Workshop Randomization and Approximation Techniques in Computer Science Pub Date : 1998-10-08 DOI: 10.1007/3-540-49543-6_9
A. Sharell
{"title":"A Note on Bounding the Mixing Time by Linear Programming","authors":"A. Sharell","doi":"10.1007/3-540-49543-6_9","DOIUrl":"https://doi.org/10.1007/3-540-49543-6_9","url":null,"abstract":"","PeriodicalId":423704,"journal":{"name":"International Workshop Randomization and Approximation Techniques in Computer Science","volume":"12 10","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131687459","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}
引用次数: 0
Fringe Analysis of Synchronized Parallel Algorithms on 2-3 Trees 2-3树同步并行算法的条纹分析
International Workshop Randomization and Approximation Techniques in Computer Science Pub Date : 1998-10-08 DOI: 10.1007/3-540-49543-6_11
Ricardo Baeza-Yates, J. Gabarró, X. Messeguer
{"title":"Fringe Analysis of Synchronized Parallel Algorithms on 2-3 Trees","authors":"Ricardo Baeza-Yates, J. Gabarró, X. Messeguer","doi":"10.1007/3-540-49543-6_11","DOIUrl":"https://doi.org/10.1007/3-540-49543-6_11","url":null,"abstract":"","PeriodicalId":423704,"journal":{"name":"International Workshop Randomization and Approximation Techniques in Computer Science","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116919305","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}
引用次数: 1
Disjoint Paths in Expander Graphs via Random Walks: A Short Survey 通过随机行走的扩展图中的不相交路径:一个简短的调查
International Workshop Randomization and Approximation Techniques in Computer Science Pub Date : 1998-10-08 DOI: 10.1007/3-540-49543-6_1
A. Frieze
{"title":"Disjoint Paths in Expander Graphs via Random Walks: A Short Survey","authors":"A. Frieze","doi":"10.1007/3-540-49543-6_1","DOIUrl":"https://doi.org/10.1007/3-540-49543-6_1","url":null,"abstract":"","PeriodicalId":423704,"journal":{"name":"International Workshop Randomization and Approximation Techniques in Computer Science","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116280553","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
A Random Server Model for Private Information Retrieval or How to Achieve Information Theoretic PIR Avoiding Database Replication 私有信息检索的随机服务器模型或如何实现信息论PIR避免数据库复制
International Workshop Randomization and Approximation Techniques in Computer Science Pub Date : 1998-10-08 DOI: 10.1007/3-540-49543-6_17
Yael Gertner, S. Goldwasser, T. Malkin
{"title":"A Random Server Model for Private Information Retrieval or How to Achieve Information Theoretic PIR Avoiding Database Replication","authors":"Yael Gertner, S. Goldwasser, T. Malkin","doi":"10.1007/3-540-49543-6_17","DOIUrl":"https://doi.org/10.1007/3-540-49543-6_17","url":null,"abstract":"","PeriodicalId":423704,"journal":{"name":"International Workshop Randomization and Approximation Techniques in Computer Science","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114540710","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}
引用次数: 94
Second-Order Methods for Distributed Approximate Single- and Multicommodity Flow 分布近似单商品流和多商品流的二阶方法
International Workshop Randomization and Approximation Techniques in Computer Science Pub Date : 1998-10-08 DOI: 10.1007/3-540-49543-6_29
S. Muthukrishnan, Torsten Suel
{"title":"Second-Order Methods for Distributed Approximate Single- and Multicommodity Flow","authors":"S. Muthukrishnan, Torsten Suel","doi":"10.1007/3-540-49543-6_29","DOIUrl":"https://doi.org/10.1007/3-540-49543-6_29","url":null,"abstract":"","PeriodicalId":423704,"journal":{"name":"International Workshop Randomization and Approximation Techniques in Computer Science","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123144577","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}
引用次数: 8
Complexity of Sequential Pattern Matching Algorithms 顺序模式匹配算法的复杂性
International Workshop Randomization and Approximation Techniques in Computer Science Pub Date : 1998-10-08 DOI: 10.1007/3-540-49543-6_16
M. Régnier, W. Szpankowski
{"title":"Complexity of Sequential Pattern Matching Algorithms","authors":"M. Régnier, W. Szpankowski","doi":"10.1007/3-540-49543-6_16","DOIUrl":"https://doi.org/10.1007/3-540-49543-6_16","url":null,"abstract":"","PeriodicalId":423704,"journal":{"name":"International Workshop Randomization and Approximation Techniques in Computer Science","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132984313","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}
引用次数: 11
Almost Optimal (on the average) Combinatorial Algorithms for Boolean Matrix Product Witnesses, Computing the Diameter (Extended Abstract) 布尔矩阵积见证的几乎最优(平均)组合算法，计算直径(扩展摘要)
International Workshop Randomization and Approximation Techniques in Computer Science Pub Date : 1998-10-08 DOI: 10.1007/3-540-49543-6_18
C. Schnorr, C. Subramanian
{"title":"Almost Optimal (on the average) Combinatorial Algorithms for Boolean Matrix Product Witnesses, Computing the Diameter (Extended Abstract)","authors":"C. Schnorr, C. Subramanian","doi":"10.1007/3-540-49543-6_18","DOIUrl":"https://doi.org/10.1007/3-540-49543-6_18","url":null,"abstract":"","PeriodicalId":423704,"journal":{"name":"International Workshop Randomization and Approximation Techniques in Computer Science","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129325448","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
Robotic Exploration, Brownian Motion and Electrical Resistance 机器人探索，布朗运动和电阻
International Workshop Randomization and Approximation Techniques in Computer Science Pub Date : 1998-10-08 DOI: 10.1007/3-540-49543-6_10
I. Wagner, M. Lindenbaum, A. Bruckstein
{"title":"Robotic Exploration, Brownian Motion and Electrical Resistance","authors":"I. Wagner, M. Lindenbaum, A. Bruckstein","doi":"10.1007/3-540-49543-6_10","DOIUrl":"https://doi.org/10.1007/3-540-49543-6_10","url":null,"abstract":"","PeriodicalId":423704,"journal":{"name":"International Workshop Randomization and Approximation Techniques in Computer Science","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122963765","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}
引用次数: 26
首页 上一页 下一页 尾页
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学术官方微信