• 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 25,548
Next 10 →

Insights from additional content

by Brian D. Davison
"... Replaying or simulation using web traffic logs are common methods of evaluating proxy caches. Request traces are also used to characterize typical web workloads. Unfortunately, most common, publicly available request logs have serious deficiencies because of what is omitted from the logs. In this pa ..."
Abstract - Add to MetaCart
. In this paper we enumerate a number of these deficiencies and examine the benefits of more complete logs. Additionally, we investigate some of the additional insights available from logs containing full content, and how they might apply to content-based prefetching proxies.

Additional Content Contributors.......................................................................................................... 9

by unknown authors
"... About the Swensrud Depression Prevention Initiative (SDPI)............................................................ 13 SDPI Community Program – iGROW................................................................................................... 13 iGROW Programming............................ ..."
Abstract - Add to MetaCart
About the Swensrud Depression Prevention Initiative (SDPI)............................................................ 13 SDPI Community Program – iGROW................................................................................................... 13 iGROW Programming.......................................................................................................................... 14

MATRIX FACTORIZATION TECHNIQUES FOR RECOMMENDER SYSTEMS

by Yehuda Koren, Robert Bell, Chris Volinsky - IEEE COMPUTER , 2009
"... As the Netflix Prize competition has demonstrated, matrix factorization models are superior to classic nearest-neighbor techniques for producing product recommendations, allowing the incorporation of additional information such as implicit feedback, temporal effects, and confidence levels. Modern co ..."
Abstract - Cited by 593 (4 self) - Add to MetaCart
As the Netflix Prize competition has demonstrated, matrix factorization models are superior to classic nearest-neighbor techniques for producing product recommendations, allowing the incorporation of additional information such as implicit feedback, temporal effects, and confidence levels. Modern

XORs in the air: practical wireless network coding

by Sachin Katti, Hariharan Rahul, Wenjun Hu, Dina Katabi, Muriel Médard, Jon Crowcroft - In Proc. ACM SIGCOMM , 2006
"... This paper proposes COPE, a new architecture for wireless mesh networks. In addition to forwarding packets, routers mix (i.e., code) packets from different sources to increase the information content of each transmission. We show that intelligently mixing packets increases network throughput. Our de ..."
Abstract - Cited by 548 (20 self) - Add to MetaCart
This paper proposes COPE, a new architecture for wireless mesh networks. In addition to forwarding packets, routers mix (i.e., code) packets from different sources to increase the information content of each transmission. We show that intelligently mixing packets increases network throughput. Our

Authoritative Sources in a Hyperlinked Environment

by Jon M. Kleinberg - JOURNAL OF THE ACM , 1999
"... The network structure of a hyperlinked environment can be a rich source of information about the content of the environment, provided we have effective means for understanding it. We develop a set of algorithmic tools for extracting information from the link structures of such environments, and repo ..."
Abstract - Cited by 3632 (12 self) - Add to MetaCart
The network structure of a hyperlinked environment can be a rich source of information about the content of the environment, provided we have effective means for understanding it. We develop a set of algorithmic tools for extracting information from the link structures of such environments

The SWISS-PROT protein sequence database and its supplement TrEMBL in 2000

by Amos Bairoch, Rolf Apweiler - Nucleic Acids Res , 2000
"... SWISS-PROT is a curated protein sequence database which strives to provide a high level of annotation (such as the description of the function of a protein, its domains structure, post-translational modifications, variants, etc.), a minimal level of redundancy and high level of integration with othe ..."
Abstract - Cited by 773 (21 self) - Add to MetaCart
with other databases. Recent developments of the database include format and content enhancements, cross-references to additional databases, new documentation files and improvements to TrEMBL, a computer-annotated supplement to SWISS-PROT. TrEMBL consists of entries in SWISS-PROT-like format derived from

* § 70.65 Additional Content of Application

by Harry Felsher, U. S. Nrc, Performance Requirements , 2000
"... " * Pre and post licensing changes " * Risk-informed, performance-based " * Covers major accidents only- Part 20 addresses safety for normal operating conditions/upsets " * Requires "integrated " look at accident safety ..."
Abstract - Add to MetaCart
" * Pre and post licensing changes " * Risk-informed, performance-based " * Covers major accidents only- Part 20 addresses safety for normal operating conditions/upsets " * Requires "integrated " look at accident safety

Application-Level Multicast Using Content-Addressable Networks

by Sylvia Ratnasamy, Mark Handley, Richard Karp, Scott Shenker , 2001
"... Most currently proposed solutions to application-level multicast organize the group members into an application-level mesh over which a DistanceVector routing protocol, or a similar algorithm, is used to construct source-rooted distribution trees. The use of a global routing protocol limits the s ..."
Abstract - Cited by 372 (8 self) - Add to MetaCart
model to a single source. Our scheme builds on recent work on Content-Addressable Networks (CANs). Extending the CAN framework to support multicast comes at trivial additional cost and, because of the structured nature of CAN topologies, obviates the need for a multicast routing algorithm. Given

Limits on super-resolution and how to break them

by Simon Baker, Takeo Kanade - IEEE Transactions on Pattern Analysis and Machine Intelligence , 2002
"... AbstractÐNearly all super-resolution algorithms are based on the fundamental constraints that the super-resolution image should generate the low resolution input images when appropriately warped and down-sampled to model the image formation process. �These reconstruction constraints are normally com ..."
Abstract - Cited by 421 (7 self) - Add to MetaCart
these results empirically and show that, for large enough magnification factors, any smoothness prior leads to overly smooth results with very little high-frequency content �however, many low resolution input images are used). In the second part of this paper, we propose a super-resolution algorithm that uses a

The Table Lens: Merging Graphical and Symbolic Representations in an Interactive Focus+Context Visualization for Tabular Information

by Ramana Rao, Stuart K. Card , 1994
"... We present a new visualization, called the Table Lens, for visualizing and making sense of large tables. The visualization uses a focus context (fisheye) technique that works effectively on tabular information because it allows display of crucial label information and multiple distal focal areas. In ..."
Abstract - Cited by 396 (3 self) - Add to MetaCart
. In addition, a graphical mapping scheme for depicting table contents has been developed for the most widespread kind of tables, the cases-by-variables table. The Table Lens fuses symbolic and graphical representations into a single coherent view that can be fluidly adjusted by the user. This fusion
Next 10 →
Results 1 - 10 of 25,548
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