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

Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)最新文献

筛选
英文 中文
Informatin Retrieval on the Web 网络信息检索
Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280) Pub Date : 1998-11-08 DOI: 10.1109/SFCS.1998.743423
A. Broder, M. Henzinger
{"title":"Informatin Retrieval on the Web","authors":"A. Broder, M. Henzinger","doi":"10.1109/SFCS.1998.743423","DOIUrl":"https://doi.org/10.1109/SFCS.1998.743423","url":null,"abstract":"The Web explosion offers a bonanza of algorithmic problems. In particular, information retrieval in the web context requires methods and ideas that have not been addressed in the classic IR literature. This tutorial will survey emerging techniques for IR in the web context and discuss some of the pertinent open problems. The list of topics includes search engine technology, ranking and classification methods, web measurements (usage, size, connectivity), and new graph and data structure problems arising in the web IR context. 1 URL of Slides The slides of the talk can be found at http://www. research.digital.com/SRC/personal/Monika Henzinger/ slides.html ∗Compaq Systems Research Ctr., 130 Lytton Ave., Palo Alto, CA, 94301; http://www.research.digital.com/SRC/personal/Andrei Broder/ home.html; broder@pa.dec.com. †Compaq Systems Research Ctr., 130 Lytton Ave., Palo Alto, CA, 94301; http://www.research.digital.com/SRC/personal/ Monika Henzinger/home.html; monika@pa.dec.com.","PeriodicalId":228145,"journal":{"name":"Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130474923","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
Tseitin's tautologies and lower bounds for Nullstellensatz proofs tseittin的重言式和Nullstellensatz证明的下界
Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280) Pub Date : 1998-11-08 DOI: 10.1109/SFCS.1998.743515
D. Grigoriev
{"title":"Tseitin's tautologies and lower bounds for Nullstellensatz proofs","authors":"D. Grigoriev","doi":"10.1109/SFCS.1998.743515","DOIUrl":"https://doi.org/10.1109/SFCS.1998.743515","url":null,"abstract":"We use the known linear lower bound for Tseitin's tautologies for establishing linear lower bounds on the degree of Nullstellensatz proofs (in the usual boolean setting) for explicitly constructed systems of polynomials of a constant (in our construction 6) degree. It holds over any field of characteristic distinct from 2. Previously, a linear lower bound was proved for an explicitly constructed system of polynomials of a logarithmic degree.","PeriodicalId":228145,"journal":{"name":"Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116832368","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
Map graphs in polynomial time 在多项式时间内映射图形
Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280) Pub Date : 1998-11-08 DOI: 10.1109/SFCS.1998.743490
M. Thorup
{"title":"Map graphs in polynomial time","authors":"M. Thorup","doi":"10.1109/SFCS.1998.743490","DOIUrl":"https://doi.org/10.1109/SFCS.1998.743490","url":null,"abstract":"Z. Chen et al. (1997, 1998) have introduced a modified notion of planarity, where two faces are considered adjacent if they share at least one point. The corresponding abstract graphs are called map graphs. Chen et al. raised the question of whether map graphs can be recognized in polynomial time. They showed that the decision problem is in NP and presented a polynomial time algorithm for the special case where we allow at most 4 faces to intersect in any point-for only 3 are allowed to intersect in a point, we get the usual planar graphs. Chen et al. conjectured that map graphs can be recognized in polynomial time, and in this paper, their conjecture is settled affirmatively.","PeriodicalId":228145,"journal":{"name":"Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116908312","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}
引用次数: 48
The shortest vector in a lattice is hard to approximate to within some constant 晶格中最短的向量很难在某个常数内近似
Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280) Pub Date : 1998-11-08 DOI: 10.1109/SFCS.1998.743432
Daniele Micciancio
{"title":"The shortest vector in a lattice is hard to approximate to within some constant","authors":"Daniele Micciancio","doi":"10.1109/SFCS.1998.743432","DOIUrl":"https://doi.org/10.1109/SFCS.1998.743432","url":null,"abstract":"We show the shortest vector problem in the l/sub 2/ norm is NP-hard (for randomized reductions) to approximate within any constant factor less than /spl radic/2. We also give a deterministic reduction under a reasonable number theoretic conjecture. Analogous results hold in any l/sub p/ norm (p/spl ges/1). In proving our NP-hardness result, we give an alternative construction satisfying Ajtai's probabilistic variant of Sauer's lemma, that greatly simplifies Ajtai's original proof.","PeriodicalId":228145,"journal":{"name":"Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134157784","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}
引用次数: 276
Faster algorithms for string matching problems: matching the convolution bound 更快的字符串匹配问题算法:匹配卷积界
Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280) Pub Date : 1998-11-08 DOI: 10.1109/SFCS.1998.743440
P. Indyk
{"title":"Faster algorithms for string matching problems: matching the convolution bound","authors":"P. Indyk","doi":"10.1109/SFCS.1998.743440","DOIUrl":"https://doi.org/10.1109/SFCS.1998.743440","url":null,"abstract":"In this paper we give a randomized O(nlogn)-time algorithm for the string matching with don't cares problem. This improves the Fischer-Paterson bound from 1974 and answers the open problem posed (among others) by Weiner and Galil. Using the same technique, we give an O(nlogn)-time algorithm for other problems, including subset matching, tree pattern matching, (general) approximate threshold matching and point set matching. As this bound essentially matches the complexity of computing of the fast Fourier transform which is the only known technique for solving problems of this type, it is likely that the algorithms are in fact optimal. Additionally the technique used for the threshold matching problem can be applied to the on-line version of this problem, in which we are allowed to preprocess the text and require to process the pattern in time sublinear in the text length. This result involves an interesting variant of the Karp-Rabin fingerprint method in which hash functions are locality-sensitive, i.e. the probability of collision of two words depends on the distance between them.","PeriodicalId":228145,"journal":{"name":"Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134638571","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}
引用次数: 98
On approximate nearest neighbors in non-Euclidean spaces 非欧几里得空间中的近似近邻
Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280) Pub Date : 1998-11-08 DOI: 10.1109/SFCS.1998.743438
P. Indyk
{"title":"On approximate nearest neighbors in non-Euclidean spaces","authors":"P. Indyk","doi":"10.1109/SFCS.1998.743438","DOIUrl":"https://doi.org/10.1109/SFCS.1998.743438","url":null,"abstract":"The nearest neighbor search (NNS) problem is the following: Given a set of n points P={p/sub 1/,...,p/sub n/} in some metric space X, preprocess P so as to efficiently answer queries which require finding a point in P closest to a query point q/spl isin/X. The approximate nearest neighbor search (c-NNS) is a relaxation of NNS which allows to return any point within c times the distance to the nearest neighbor (called c-nearest neighbor). This problem is of major and growing importance to a variety of applications. In this paper we give an algorithm for (4log/sub 1+/spl rho//log4d+3)-NNS algorithm in l/sub /spl infin///sup d/ with O(dn/sup 1+/spl rho//logn) storage and O(dlogn) query time. In particular this yields the first algorithm for O(1)-NNS for l/sub /spl infin// with subexponential storage. The preprocessing time is linear in the size of the data structure. The algorithm can be also used (after simple modifications) to output the exact nearest neighbor in time bounded bounded O(dlogn) plus the number of (4log/sub 1+/spl rho//log4d+3)-nearest neighbors of the query point. Building on this result, we also obtain an approximation algorithm for a general class of product metrics. Finally: we show that for any c<3 the c-NNS problem in l/sub /spl infin// is provably hard for a version of the indexing model introduced by Hellerstein et al. (1997).","PeriodicalId":228145,"journal":{"name":"Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)","volume":"159 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133967257","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}
引用次数: 53
Improved bounds and algorithms for hypergraph two-coloring 超图二次着色的改进界和算法
Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280) Pub Date : 1998-11-08 DOI: 10.1109/SFCS.1998.743519
J. Radhakrishnan, A. Srinivasan
{"title":"Improved bounds and algorithms for hypergraph two-coloring","authors":"J. Radhakrishnan, A. Srinivasan","doi":"10.1109/SFCS.1998.743519","DOIUrl":"https://doi.org/10.1109/SFCS.1998.743519","url":null,"abstract":"We show that for all large n, every n-uniform hypergraph with at most 0.7/spl radic/(n/lnn)/spl times/2/sup n/ edges can be two-colored. We, in fact, present fast algorithms that output a proper two-coloring with high probability for such hypergraphs. We also derandomize and parallelize these algorithms, to derive NC/sup 1/ versions of these results. This makes progress on a problem of Erdos (1963), improving the previous-best bound of n/sup 1/3-0(1)//spl times/2/sup n/ due to Beck (1978). We further generalize this to a \"local\" version, improving on one of the first applications of the Lovasz Local Lemma.","PeriodicalId":228145,"journal":{"name":"Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125389187","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}
引用次数: 14
Random projection: a new approach to VLSI layout 随机投影:VLSI布局的新方法
Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280) Pub Date : 1998-11-08 DOI: 10.1109/SFCS.1998.743489
S. Vempala
{"title":"Random projection: a new approach to VLSI layout","authors":"S. Vempala","doi":"10.1109/SFCS.1998.743489","DOIUrl":"https://doi.org/10.1109/SFCS.1998.743489","url":null,"abstract":"We show that random projection, the technique of projecting a set of points to a randomly chosen low-dimensional subspace, can be used to solve problems in VLSI layout. Specifically, for the problem of laying out a graph on a 2-dimensional grid so as to minimize the maximum edge length, we obtain an O(log/sup 3.5/ n) approximation algorithm (this is the first o(n) approximation), and for the bicriteria problem of minimizing the total edge length while keeping the maximum length bounded, we obtain an O(log/sup 3/ n, log/sup 3.5/ n) approximation. Our algorithms also work for d-dimensional versions of these problems (for any fixed d) with polylog approximation guarantees. Besides random projection, the main components of the algorithms are a linear programming relaxation, and volume-respecting Euclidean embeddings.","PeriodicalId":228145,"journal":{"name":"Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)","volume":"372 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124653112","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}
引用次数: 47
Stability of adversarial queues via fluid models 基于流体模型的对抗队列的稳定性
Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280) Pub Date : 1998-11-08 DOI: 10.1109/SFCS.1998.743429
D. Gamarnik
{"title":"Stability of adversarial queues via fluid models","authors":"D. Gamarnik","doi":"10.1109/SFCS.1998.743429","DOIUrl":"https://doi.org/10.1109/SFCS.1998.743429","url":null,"abstract":"The subject of this paper is stability properties of adversarial queueing networks. Such queueing systems are used to model packet switch communication networks, in which packets are generated and routed dynamically, and have become a subject of research focus recently. Adversarial queueing networks are defined to be stable, if the number of packets stays bounded over time. A central question is determining which adversarial queueing networks are stable, when an arbitrary greedy packet routing policy is implemented. In this paper we show how stability of a queueing network can be determined by considering an associated fluid models. Our main result is that the stability of the fluid model implies the stability of an underlying adversarial queueing network. This opens an opportunity for analyzing stability of adversarial networks, using established stability methods from continuous time processes, for example, the method of Lyapunov function or trajectory decomposition. We demonstrate the use of these methods on several examples.","PeriodicalId":228145,"journal":{"name":"Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121128037","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}
引用次数: 44
Perfect information leader election in log*n+O(1) rounds 在log*n+O(1)轮中进行完全信息领袖选举
Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280) Pub Date : 1998-11-08 DOI: 10.1109/SFCS.1998.743508
A. Russell, David Zuckerman
{"title":"Perfect information leader election in log*n+O(1) rounds","authors":"A. Russell, David Zuckerman","doi":"10.1109/SFCS.1998.743508","DOIUrl":"https://doi.org/10.1109/SFCS.1998.743508","url":null,"abstract":"In the leader election problem, n players wish to elect a random leader. The difficulty is that some coalition of players may conspire to elect one of its own members. We adopt the perfect information model: all communication is by broadcast, and the bad players have unlimited computational power. Within a round, they may also wait to see the inputs of the good players. A protocol is called resilient if a good leader is elected with probability bounded away from 0. We give a simple, constructive leader election protocol that is resilient against coalitions of size /spl beta/n, for any /spl beta/<1/2. Our protocol takes log*n+O(1) rounds, each player sending at most log n bits per round. For any constant k, our protocol can be modified to take k rounds and be resilient against coalitions of size /spl epsi/n(log/sup (k)/n)/sup 3/, where /spl epsi/ is a small enough constant and log(k) denotes the logarithm iterated k times. This is constructive for k/spl ges/3.","PeriodicalId":228145,"journal":{"name":"Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129684645","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}
引用次数: 76
首页 上一页 下一页 尾页
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学术官方微信