• 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 11 - 20 of 567,371
Next 10 →

Qualitative Researching

by James Mason, Vasilis Fthenakis, Ken Zweibel, Tom Hansen, Thomas Nikolakakis , 1996
"... ltaic (PV) electricity production from an intermittent Since 1978, compressed air energy storage (CAES) compressed air can then be released on demand to the CAES plant’s turbo-generator set to generate premium value electricity. The first CAES plant was built in broadened in the ittency of wind g wi ..."
Abstract - Cited by 591 (0 self) - Add to MetaCart
ltaic (PV) electricity production from an intermittent Since 1978, compressed air energy storage (CAES) compressed air can then be released on demand to the CAES plant’s turbo-generator set to generate premium value electricity. The first CAES plant was built in broadened in the ittency of wind g

Reducing Storage Costs for Federated Search of Text Databases

by Jie Lu School, Jie Lu, Jamie Callan - In Proceedings of the National Conference on Digital Government Research (dg.o2003 , 2003
"... In environments containing many text search engines a federated search system provides people with a single point of access. When search engines are managed by independent organizations two key problems are discovering and representing the contents of each text database. Query-based sampling is a re ..."
Abstract - Add to MetaCart
costs can be surprisingly large. This paper investigates methods of pruning sampled documents to reduce storage costs. The experimental results demonstrate that disk storage costs can be reduced by 54-93% while causing only minor losses in federated search accuracy.

Instance-based learning algorithms

by David W. Aha, Dennis Kibler, Marc K. Albert - Machine Learning , 1991
"... Abstract. Storing and using specific instances improves the performance of several supervised learning algorithms. These include algorithms that learn decision trees, classification rules, and distributed networks. However, no investigation has analyzed algorithms that use only specific instances to ..."
Abstract - Cited by 1359 (18 self) - Add to MetaCart
. This approach extends the nearest neighbor algorithm, which has large storage requirements. We describe how storage requirements can be significantly reduced with, at most, minor sacrifices in learning rate and classification accuracy. While the storage-reducing algorithm performs well on several realworld

A Singular Value Thresholding Algorithm for Matrix Completion

by Jian-Feng Cai, Emmanuel J. Candès, Zuowei Shen , 2008
"... This paper introduces a novel algorithm to approximate the matrix with minimum nuclear norm among all matrices obeying a set of convex constraints. This problem may be understood as the convex relaxation of a rank minimization problem, and arises in many important applications as in the task of reco ..."
Abstract - Cited by 539 (20 self) - Add to MetaCart
storage space and keep the computational cost of each iteration low. On

The Design and Implementation of a Log-Structured File System

by Mendel Rosenblum, John K. Ousterhout - ACM Transactions on Computer Systems , 1992
"... This paper presents a new technique for disk storage management called a log-structured file system. A logstructured file system writes all modifications to disk sequentially in a log-like structure, thereby speeding up both file writing and crash recovery. The log is the only structure on disk; it ..."
Abstract - Cited by 1087 (9 self) - Add to MetaCart
This paper presents a new technique for disk storage management called a log-structured file system. A logstructured file system writes all modifications to disk sequentially in a log-like structure, thereby speeding up both file writing and crash recovery. The log is the only structure on disk

The Google File System

by Sanjay Ghemawat, Howard Gobioff, Shun-tak Leung - ACM SIGOPS Operating Systems Review
"... We have designed and implemented the Google File Sys-tem, a scalable distributed file system for large distributed data-intensive applications. It provides fault tolerance while running on inexpensive commodity hardware, and it delivers high aggregate performance to a large number of clients. While ..."
Abstract - Cited by 1470 (2 self) - Add to MetaCart
to reexamine traditional choices and explore rad-ically different design points. The file system has successfully met our storage needs. It is widely deployed within Google as the storage platform for the generation and processing of data used by our ser-vice as well as research and development efforts

Scale and performance in a distributed file system

by John H. Howard, Michael L. Kazar, Sherri G. Menees, A. Nichols, M. Satyanarayanan, Robert N. Sidebotham, Michael J. West - ACM Transactions on Computer Systems , 1988
"... The Andrew File System is a location-transparent distributed tile system that will eventually span more than 5000 workstations at Carnegie Mellon University. Large scale affects performance and complicates system operation. In this paper we present observations of a prototype implementation, motivat ..."
Abstract - Cited by 937 (47 self) - Add to MetaCart
, motivate changes in the areas of cache validation, server process structure, name translation, and low-level storage representation, and quantitatively demonstrate Andrew’s ability to scale gracefully. We establish the importance of whole-file transfer and caching in Andrew by comparing its performance

Why Cloud Storage Cost saving

by Muhammad Rizwan Asghar, Giovanni Russello, Bruno Crispo, Mihaela Ion , 2013
"... The 20th ACM Conference on Computer and Communications Security (CCS), ..."
Abstract - Add to MetaCart
The 20th ACM Conference on Computer and Communications Security (CCS),

Bundle Adjustment -- A Modern Synthesis

by Bill Triggs, Philip McLauchlan, Richard Hartley, Andrew Fitzgibbon - VISION ALGORITHMS: THEORY AND PRACTICE, LNCS , 2000
"... This paper is a survey of the theory and methods of photogrammetric bundle adjustment, aimed at potential implementors in the computer vision community. Bundle adjustment is the problem of refining a visual reconstruction to produce jointly optimal structure and viewing parameter estimates. Topics c ..."
Abstract - Cited by 555 (12 self) - Add to MetaCart
covered include: the choice of cost function and robustness; numerical optimization including sparse Newton methods, linearly convergent approximations, updating and recursive methods; gauge (datum) invariance; and quality control. The theory is developed for general robust cost functions rather than

Globus: A Metacomputing Infrastructure Toolkit

by Ian Foster, Carl Kesselman - International Journal of Supercomputer Applications , 1996
"... Emerging high-performance applications require the ability to exploit diverse, geographically distributed resources. These applications use high-speed networks to integrate supercomputers, large databases, archival storage devices, advanced visualization devices, and/or scientific instruments to for ..."
Abstract - Cited by 1922 (52 self) - Add to MetaCart
Emerging high-performance applications require the ability to exploit diverse, geographically distributed resources. These applications use high-speed networks to integrate supercomputers, large databases, archival storage devices, advanced visualization devices, and/or scientific instruments
Next 10 →
Results 11 - 20 of 567,371
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