Sciweavers

727 search results - page 125 / 146
» Private approximation of search problems
Sort
View
GECCO
2005
Springer
140views Optimization» more  GECCO 2005»
14 years 3 months ago
MDGA: motif discovery using a genetic algorithm
Computationally identifying transcription factor binding sites in the promoter regions of genes is an important problem in computational biology and has been under intensive resea...
Dongsheng Che, Yinglei Song, Khaled Rasheed
HPDC
2000
IEEE
14 years 2 months ago
Performance Evaluation of a Firewall-Compliant Globus-based Wide-Area Cluster System
In this paper, we present a performance evaluation of a wide-area cluster system based on a rewallenabled Globus metacomputing toolkit. In order to establish communication links ...
Yoshio Tanaka, Motonori Hirano, Mitsuhisa Sato, Hi...
WSDM
2009
ACM
161views Data Mining» more  WSDM 2009»
14 years 4 months ago
Predicting the readability of short web summaries
Readability is a crucial presentation attribute that web summarization algorithms consider while generating a querybaised web summary. Readability quality also forms an important ...
Tapas Kanungo, David Orr
SIGIR
2006
ACM
14 years 3 months ago
AggregateRank: bringing order to web sites
Since the website is one of the most important organizational structures of the Web, how to effectively rank websites has been essential to many Web applications, such as Web sear...
Guang Feng, Tie-Yan Liu, Ying Wang, Ying Bao, Zhim...
CIKM
2004
Springer
14 years 3 months ago
Local methods for estimating pagerank values
The Google search engine uses a method called PageRank, together with term-based and other ranking techniques, to order search results returned to the user. PageRank uses link ana...
Yen-Yu Chen, Qingqing Gan, Torsten Suel