Results 1 - 10 of 22,754

Focused crawling: a new approach to topic-specific Web resource discovery

by Soumen Chakrabarti, Martin van den Berg, Byron Dom , 1999
"... The rapid growth of the World-Wide Web poses unprecedented scaling challenges for general-purpose crawlers and search engines. In this paper we describe a new hypertext resource discovery system called a Focused Crawler. The goal of a focused crawler is to selectively seek out pages that are relevan ..."
Abstract - Cited by 637 (10 self) - Add to MetaCart
that are likely to be most relevant for the crawl, and avoids irrelevant regions of the Web. This leads to significant savings in hardware and network resources, and helps keep the crawl more up-to-date. To achieve such goal-directed crawling, we designed two hypertext mining programs that guide our crawler: a

Hypertext Transfer Protocol - HTTP/1.1

by R. Fielding, H. Frystyk, Tim Berners-Lee, J. Gettys, J. C. Mogul , 1996
"... The Hypertext Transfer Protocol (HTTP) is an application-level protocol for distributed, collaborative, hypermedia information systems. It is a generic, stateless, object-oriented protocol which can be used for many tasks, such as name servers and distributed object management systems, through exten ..."
Abstract - Cited by 908 (27 self) - Add to MetaCart
The Hypertext Transfer Protocol (HTTP) is an application-level protocol for distributed, collaborative, hypermedia information systems. It is a generic, stateless, object-oriented protocol which can be used for many tasks, such as name servers and distributed object management systems, through

Cluster analysis and display of genome-wide expression patterns’,

by Michael B Eisen , Paul T Spellman , Patrick O Brown , David Botstein - Proc. Natl. Acad. , 1998
"... ABSTRACT A system of cluster analysis for genome-wide expression data from DNA microarray hybridization is described that uses standard statistical algorithms to arrange genes according to similarity in pattern of gene expression. The output is displayed graphically, conveying the clustering and th ..."
Abstract - Cited by 2895 (44 self) - Add to MetaCart
ABSTRACT A system of cluster analysis for genome-wide expression data from DNA microarray hybridization is described that uses standard statistical algorithms to arrange genes according to similarity in pattern of gene expression. The output is displayed graphically, conveying the clustering

Computer Vision

by Kusuma Kumari B. M , 1982
"... Driver inattention is one of the main causes of traffic accidents. Monitoring a driver to detect inattention is a complex problem that involves physiological and behavioral elements. Different approaches have been made, and among them Computer Vision has the potential of monitoring the person behind ..."
Abstract - Cited by 1041 (11 self) - Add to MetaCart
behind the wheel without interfering with his driving. In this paper I have developed a system that can monitor the alertness of drivers in order to prevent people from falling asleep at the wheel. The other main aim of this algorithm is to have efficient performance on low quality webcam and without

Goodput Analysis and Link Adaptation for IEEE 802.11a Wireless LANs

by Daji Qiao, Student Member, Sunghyun Choi, Kang G. Shin - IEEE Trans. on Mobile Computing , 2002
"... Abstract—Link adaptation to dynamically select the data transmission rate at a given time has been recognized as an effective way to improve the goodput performance of the IEEE 802.11 wireless local-area networks (WLANs). Recently, with the introduction of the new high-speed 802.11a physical layer ( ..."
Abstract - Cited by 145 (11 self) - Add to MetaCart
, the wireless channel condition, and the frame retry count. At run-time, a wireless station determines the most appropriate PHY mode for the next transmission attempt by a simple table lookup, using the most upto-date system status as the index. Our in-depth simulation shows that the proposed MPDU-based link

A Probabilistic Model of Information Retrieval: Development and Status

by K. Sparck Jones, S. Walker, S.E. Robertson , 1998
"... The paper combines a comprehensive account of the probabilistic model of retrieval with new systematic experiments on TREC Programme material. It presents the model from its foundations through its logical development to cover more aspects of retrieval data and a wider range of system functions. Eac ..."
Abstract - Cited by 360 (25 self) - Add to MetaCart
The paper combines a comprehensive account of the probabilistic model of retrieval with new systematic experiments on TREC Programme material. It presents the model from its foundations through its logical development to cover more aspects of retrieval data and a wider range of system functions

Complexity of finding embeddings in a k-tree

by Stefan Arnborg, Derek G. Corneil , Andrzej Proskurowski - SIAM JOURNAL OF DISCRETE MATHEMATICS , 1987
"... A k-tree is a graph that can be reduced to the k-complete graph by a sequence of removals of a degree k vertex with completely connected neighbors. We address the problem of determining whether a graph is a partial graph of a k-tree. This problem is motivated by the existence of polynomial time al ..."
Abstract - Cited by 386 (1 self) - Add to MetaCart
algorithms for many combinatorial problems on graphs when the graph is constrained to be a partial k-tree for fixed k. These algorithms have practical applications in areas such as reliability, concurrent broadcasting and evaluation of queries in a relational database system. We determine the complexity

Global Economic Prospects and the Developing Countries 2000. Washington,D.C

by The International Bank , 1999
"... The findings, interpretations, and conclusions expressed here do not necessarily reflect the views of the Board of Executive Directors of the World Bank or the governments they represent. The World Bank cannot guarantee the accuracy of the data included in this work. The boundaries, colors, denomina ..."
Abstract - Cited by 368 (3 self) - Add to MetaCart
, denominations, and other information shown on any map in this work do not imply on the part of the World Bank any judgment of the legal status of any territory or the endorsement or acceptance of such boundaries. Rights and Permissions The material in this work is copyrighted. No part of this work may

The Stanford FLASH multiprocessor

by Jeffrey Kuskin, David Ofelt, Mark Heinrich, John Heinlein, Richard Simoni, Kourosh Gharachorloo, John Chapin, David Nakahira, Joel Baxter, Mark Horowitz, Anoop Gupta, Mendel Rosenblum, John Hennessy - In Proceedings of the 21st International Symposium on Computer Architecture , 1994
"... The FLASH multiprocessor efficiently integrates support for cache-coherent shared memory and high-performance message passing, while minimizing both hardware and software overhead. Each node in FLASH contains a microprocessor, a portion of the machine’s global memory, a port to the interconnection n ..."
Abstract - Cited by 349 (20 self) - Add to MetaCart
, which are derived from our system-level simulator and our Verilog code, are given for several common protocol operations. The paper also describes our software strategy and FLASH’s current status. 1

Why phishing works

by Rachna Dhamija, J. D. Tygar - In Proceedings of the SIGCHI Conference on Human Factors in Computing Systems , 2006
"... To build systems shielding users from fraudulent (or phishing) websites, designers need to know which attack strategies work and why. This paper provides the first empirical evidence about which malicious strategies are successful at deceiving general users. We first analyzed a large set of captured ..."
Abstract - Cited by 346 (4 self) - Add to MetaCart
To build systems shielding users from fraudulent (or phishing) websites, designers need to know which attack strategies work and why. This paper provides the first empirical evidence about which malicious strategies are successful at deceiving general users. We first analyzed a large set
Results 1 - 10 of 22,754