• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 7,504
Next 10 →

Rank Aggregation Methods for the Web

by Cynthia Dwork, Ravi Kumar, Moni Naor, D. Sivakumar , 2010
"... We consider the problem of combining ranking results from various sources. In the context of the Web, the main applications include building meta-search engines, combining ranking functions, selecting documents based on multiple criteria, and improving search precision through word associations. Wed ..."
Abstract - Cited by 478 (6 self) - Add to MetaCart
. Wedevelop a set of techniques for the rank aggregation problem and compare their performance to that of well-known methods. A primary goal of our work is to design rank aggregation techniques that can effectively combat "spam," a serious problem in Web searches. Experiments show that our methods

Statistical pattern recognition: A review

by Anil K. Jain, Robert P. W. Duin, Jianchang Mao - IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE , 2000
"... The primary goal of pattern recognition is supervised or unsupervised classification. Among the various frameworks in which pattern recognition has been traditionally formulated, the statistical approach has been most intensively studied and used in practice. More recently, neural network techniques ..."
Abstract - Cited by 1035 (30 self) - Add to MetaCart
. New and emerging applications, such as data mining, web searching, retrieval of multimedia data, face recognition, and cursive handwriting recognition, require robust and efficient pattern recognition techniques. The objective of this review paper is to summarize and compare some of the well-known

How People revisit Web Pages: empirical findings and implications for the design of history systems

by Linda Tauscher, Saul Greenberg - International Journal of Human Computer Studies , 1997
"... We report on users ’ revisitation patterns to World Wide Web (web) pages, and use the results to lay an empirical foundation for the design of history mechanisms in web browsers. Through history, a user can return quickly to a previously visited page, possibly reducing the cognitive and physical ove ..."
Abstract - Cited by 313 (10 self) - Add to MetaCart
overhead required to navigate to it from scratch. We analysed 6 weeks of detailed usage data collected from 23 users of a wellknown web browser. We found that 58 % of an individual’s pages are revisits, and that users continually add new web pages into their repertoire of visited pages. People tend

Annotea: An Open RDF Infrastructure for Shared Web Annotations

by José Kahan, Marja-Riitta Koivunen, Eric Prud'Hommeaux, Ralph R. Swick , 2001
"... Annotea is a Web-based shared annotation system based on a general-purpose open RDF infrastructure, where annotations are modeled as a class of metadata. Annotations are viewed as statements made by an author about a Web document. Annotations are external to the documents and can be stored in one or ..."
Abstract - Cited by 375 (3 self) - Add to MetaCart
Annotea is a Web-based shared annotation system based on a general-purpose open RDF infrastructure, where annotations are modeled as a class of metadata. Annotations are viewed as statements made by an author about a Web document. Annotations are external to the documents and can be stored in one

A database and evaluation methodology for optical flow

by Simon Baker, Daniel Scharstein, J. P. Lewis, Stefan Roth, Michael J. Black, Richard Szeliski - In Proceedings of the IEEE International Conference on Computer Vision , 2007
"... The quantitative evaluation of optical flow algorithms by Barron et al. (1994) led to significant advances in performance. The challenges for optical flow algorithms today go beyond the datasets and evaluation methods proposed in that paper. Instead, they center on problems associated with complex n ..."
Abstract - Cited by 407 (22 self) - Add to MetaCart
by Barron et al., we compute the absolute flow endpoint error, measures for frame interpolation error, improved statistics, and results at motion discontinuities and in textureless regions. In October 2007, we published the performance of several well-known methods on a preliminary version of our data

Anonymous connections and onion routing

by Michael G. Reed, Paul F. Syverson, David M. Goldschlag - IEEE Journal on Selected Areas in Communications , 1998
"... Abstract—Onion routing is an infrastructure for private communication over a public network. It provides anonymous connections that are strongly resistant to both eavesdropping and traffic analysis. Onion routing’s anonymous connections are bidirectional, near real-time, and can be used anywhere a s ..."
Abstract - Cited by 368 (18 self) - Add to MetaCart
to each onion router as well as to network observers. The same goes for data carried over the connections they establish. Proxy-aware applications, such as web browsers and e-mail clients, require no modification to use onion routing, and do so through a series of proxies. A prototype onion routing

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
of captured phishing attacks and developed a set of hypotheses about why these strategies might work. We then assessed these hypotheses with a usability study in which 22 participants were shown 20 web sites and asked to determine which ones were fraudulent. We found that 23 % of the participants did not look

Efficient Identification of Web Communities

by Gary William Flake, Steve Lawrence, C. Lee Giles - IN SIXTH ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING , 2000
"... We define a community on the web as a set of sites that have more links (in either direction) to members of the community than to non-members. Members of such a community can be eciently identified in a maximum flow / minimum cut framework, where the source is composed of known members, and the sink ..."
Abstract - Cited by 293 (13 self) - Add to MetaCart
We define a community on the web as a set of sites that have more links (in either direction) to members of the community than to non-members. Members of such a community can be eciently identified in a maximum flow / minimum cut framework, where the source is composed of known members

Topologically-aware overlay construction and server selection

by Sylvia Ratnasamy, Mark Handley, Richard Karp, Scott Shenker , 2002
"... A number of large-scale distributed Internet applications could potentially benefit from some level of knowledge about the relative proximity between its participating host nodes. For example, the performance of large overlay networks could be improved if the application-level connectivity between ..."
Abstract - Cited by 341 (3 self) - Add to MetaCart
between the nodes in these networks is congruent with the underlying IP-level topology. Similarly, in the case of replicated web content, client nodes could use topological information in selecting one of multiple available servers. For such applications, one need not find the optimal solution in order

Democratizing content publication with Coral

by Michael Freedman, Eric Freudenthal, David Mazières - IN NSDI , 2004
"... CoralCDN is a peer-to-peer content distribution network that allows a user to run a web site that offers high performance and meets huge demand, all for the price of a cheap broadband Internet connection. Volunteer sites that run CoralCDN automatically replicate content as a side effect of users acc ..."
Abstract - Cited by 314 (21 self) - Add to MetaCart
accessing it. Publishing through CoralCDN is as simple as making a small change to the hostname in an object's URL; a peer-to-peer DNS layer transparently redirects browsers to nearby participating cache nodes, which in turn cooperate to minimize load on the origin web server. One of the system
Next 10 →
Results 1 - 10 of 7,504
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University