http:^^www.cs.washington.edu^homes^madani^academics.html
来自「This data set contains WWW-pages collect」· HTML 代码 · 共 40 行
HTML
40 行
Date: Tue, 10 Dec 1996 22:27:54 GMTServer: NCSA/1.4.2Content-type: text/htmlLast-modified: Mon, 18 Nov 1996 05:30:42 GMTContent-length: 1142<HTML><HEAD> <TITLE> Omid Madani </TITLE></HEAD><BODY><P>I am now in search of a topic to pursue my PhD on. For myPhD. qualifier, I studied the problem of quickly finding approximatelymatching clones in a restriction mapping experiment. I came up withan interesting algorithm to speed up the process and analyzed some ofthe tradeoffs. I think that the ideas behind the algorithm aregeneral enough to define a general scheme for approximate matching inother contexts. I was advised mainly by professor Larry <!WA0><!WA0><!WA0><ahref="http://www.cs.washington.edu/people/faculty/ruzzo.html">Ruzzo</a>, and also by professor <!WA1><!WA1><!WA1><ahref="http://www.cs.washington.edu/people/faculty/karp.html">Karp</a>. <p>Recenlty, professors Oren <!WA2><!WA2><!WA2><a href="http://www.cs.washington.edu/homes/etzioni/">Etzioni</a>, Steve<!WA3><!WA3><!WA3><ahref="http://www.cs.washington.edu/people/faculty/hanks.html">Hanks</a>,Tao <!WA4><!WA4><!WA4><a href="http://www.cs.washington.edu/homes/jiang">Jiang</a> and I began investigating afairly new problem: the <!WA5><!WA5><!WA5><ahref="http://metacrawler.cs.washington.edu:8080/index.html">metacrawler's</a>problem! We introduced a few optimization models and came up withapproximation algorithms under those models. <p>⌨️ 快捷键说明
复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?