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

CiteSeerX logo

Tools

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

Plaxton. Optimal cover time for a graph-based coupon collector process

by Nedialko B. Dimitrov, C. Greg Plaxton - In ICALP , 2005
"... In this paper we study the following covering process defined over an arbitrary directed graph. Each node is initially uncovered and is assigned a random integer rank drawn from a suitable range. The process then proceeds in rounds. In each round, a uniformly random node is selected and its lowest-r ..."
Abstract - Cited by 6 (0 self) - Add to MetaCart
In this paper we study the following covering process defined over an arbitrary directed graph. Each node is initially uncovered and is assigned a random integer rank drawn from a suitable range. The process then proceeds in rounds. In each round, a uniformly random node is selected and its lowest

Time Discounting and Time Preference: A Critical Review

by Shane Frederick, George Loewenstein - Journal of Economic Literature , 2002
"... www.people.cornell.edu/pages/edo1/. ..."
Abstract - Cited by 754 (17 self) - Add to MetaCart
www.people.cornell.edu/pages/edo1/.

Controlled and automatic human information processing

by Walter Schneider, Richard M. Shiffrin - I. Detection, search, and attention. Psychological Review , 1977
"... A two-process theory of human information processing is proposed and applied to detection, search, and attention phenomena. Automatic processing is activa-tion of a learned sequence of elements in long-term memory that is initiated by appropriate inputs and then proceeds automatically—without subjec ..."
Abstract - Cited by 841 (15 self) - Add to MetaCart
A two-process theory of human information processing is proposed and applied to detection, search, and attention phenomena. Automatic processing is activa-tion of a learned sequence of elements in long-term memory that is initiated by appropriate inputs and then proceeds automatically

Modeling Strategic Relationships for Process Reengineering

by Eric Siu-kwong Yu , 1995
"... Existing models for describing a process (such as a business process or a software development process) tend to focus on the \what " or the \how " of the process. For example, a health insurance claim process would typically be described in terms of a number of steps for assessing and appr ..."
Abstract - Cited by 545 (40 self) - Add to MetaCart
Existing models for describing a process (such as a business process or a software development process) tend to focus on the \what " or the \how " of the process. For example, a health insurance claim process would typically be described in terms of a number of steps for assessing

Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization

by Farid Alizadeh - SIAM Journal on Optimization , 1993
"... We study the semidefinite programming problem (SDP), i.e the problem of optimization of a linear function of a symmetric matrix subject to linear equality constraints and the additional condition that the matrix be positive semidefinite. First we review the classical cone duality as specialized to S ..."
Abstract - Cited by 557 (12 self) - Add to MetaCart
to SDP. Next we present an interior point algorithm which converges to the optimal solution in polynomial time. The approach is a direct extension of Ye's projective method for linear programming. We also argue that most known interior point methods for linear programs can be transformed in a

Tinydb: An acquisitional query processing system for sensor networks

by Samuel R. Madden, Michael J. Franklin, Joseph M. Hellerstein, Wei Hong - ACM Trans. Database Syst , 2005
"... We discuss the design of an acquisitional query processor for data collection in sensor networks. Acquisitional issues are those that pertain to where, when, and how often data is physically acquired (sampled) and delivered to query processing operators. By focusing on the locations and costs of acq ..."
Abstract - Cited by 609 (8 self) - Add to MetaCart
of acquiring data, we are able to significantly reduce power consumption over traditional passive systems that assume the a priori existence of data. We discuss simple extensions to SQL for controlling data acquisition, and show how acquisitional issues influence query optimization, dissemination

Optimal Capital Structure, Endogenous Bankruptcy, and the Term Structure of Credit Spreads

by Hayne E. Leland, Klaus Bjerre Toft - THE JOURNAL OF FINANCE, VOL. 51, NO. 3, PAPERS AND PROCEEDINGS OF THE FIFTY-SIXTH , 1996
"... ..."
Abstract - Cited by 520 (3 self) - Add to MetaCart
Abstract not found

Pig Latin: A Not-So-Foreign Language for Data Processing

by Christopher Olston, Benjamin Reed, Utkarsh Srivastava, Ravi Kumar, Andrew Tomkins
"... There is a growing need for ad-hoc analysis of extremely large data sets, especially at internet companies where innovation critically depends on being able to analyze terabytes of data collected every day. Parallel database products, e.g., Teradata, offer a solution, but are usually prohibitively e ..."
Abstract - Cited by 584 (12 self) - Add to MetaCart
-level, procedural style of map-reduce. The accompanying system, Pig, is fully implemented, and compiles Pig Latin into physical plans that are executed over Hadoop, an open-source, map-reduce implementation. We give a few examples of how engineers at Yahoo! are using Pig to dramatically reduce the time required

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
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

SIS: A System for Sequential Circuit Synthesis

by Ellen M. Sentovich, Kanwar Jit Singh, Luciano Lavagno, Cho Moon, Rajeev Murgai, Alexander Saldanha, Hamid Savoj, Paul R. Stephan, Robert K. Brayton, Alberto Sangiovanni-Vincentelli , 1992
"... SIS is an interactive tool for synthesis and optimization of sequential circuits. Given a state transition table, a signal transition graph, or a logic-level description of a sequential circuit, it produces an optimized net-list in the target technology while preserving the sequential input-output b ..."
Abstract - Cited by 514 (41 self) - Add to MetaCart
, new logic optimization and verification algorithms, ASTG (asynchronous signal transition graph) manipulation, and synthesis for PGA’s (programmable gate arrays). The second part contains a tutorial example illustrating the design process using SIS.
Next 10 →
Results 1 - 10 of 327,096
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-2018 The Pennsylvania State University