• 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 13,620
Next 10 →

The geometry of graphs and some of its algorithmic applications

by Nathan Linial, Eran London, Yuri Rabinovich - COMBINATORICA , 1995
"... In this paper we explore some implications of viewing graphs as geometric objects. This approach offers a new perspective on a number of graph-theoretic and algorithmic problems. There are several ways to model graphs geometrically and our main concern here is with geometric representations that res ..."
Abstract - Cited by 524 (19 self) - Add to MetaCart
their geometric images. In this paper we develop efficient algorithms for em-bedding graphs low-dimensionally with a small distortion. Further algorithmic applications include: 0 A simple, unified approach to a number of prob-lems on multicommodity flows, including the Leighton-Rae Theorem [29] and some of its ex

Taverna: A tool for the composition and enactment of bioinformatics workflows

by Tom Oinn, Matthew Addis, Justin Ferris, Darren Marvin, Tim Carver, Matthew R. Pocock, Anil Wipat - Bioinformatics , 2004
"... *To whom correspondence should be addressed. Running head: Composing and enacting workflows using Taverna Motivation: In silico experiments in bioinformatics involve the co-ordinated use of computational tools and information repositories. A growing number of these resources are being made available ..."
Abstract - Cited by 465 (8 self) - Add to MetaCart
community. The tool includes a workbench application which provides a graphical user interface for the composition of workflows. These workflows are written in a new language called the Simple conceptual unified flow language (Scufl), where by each step within a workflow represents one atomic task. Two

Modeling TCP Reno Performance: A Simple Model and Its Empirical Validation

by Jitendra Padhye, Victor Firoiu, Donald F. Towsley, James F. Kurose - IEEE/ACM Transactions on Networking , 2000
"... Abstract—The steady-state performance of a bulk transfer TCP flow (i.e., a flow with a large amount of data to send, such as FTP transfers) may be characterized by the send rate, which is the amount of data sent by the sender in unit time. In this paper we develop a simple analytic characterization ..."
Abstract - Cited by 371 (4 self) - Add to MetaCart
Abstract—The steady-state performance of a bulk transfer TCP flow (i.e., a flow with a large amount of data to send, such as FTP transfers) may be characterized by the send rate, which is the amount of data sent by the sender in unit time. In this paper we develop a simple analytic characterization

Capital Flows and Capital-Markets Crises: The Simple Economics of Sudden Stops

by Guillermo A. Calvo - Journal of Applied Economics , 1998
"... Abstract: The paper studies mechanisms through which a sudden stop in international credit flows may bring about financial and balance of payments crises. It is shown that these crises can occur even though the current account deficit is fully financed by foreign direct investment. However, equity a ..."
Abstract - Cited by 306 (8 self) - Add to MetaCart
Abstract: The paper studies mechanisms through which a sudden stop in international credit flows may bring about financial and balance of payments crises. It is shown that these crises can occur even though the current account deficit is fully financed by foreign direct investment. However, equity

SimpleFlow: A Non-iterative, Sublinear Optical Flow Algorithm

by Michael Tao, Jiamin Bai, Pushmeet Kohli, Sylvain Paris
"... Figure 1: The figure shows a pair of 4K video frames (a,b) and the corresponding optical flow result (d). Our new SimpleFlow algorithm computes the optical flow using only local operations that can be efficiently implemented on parallel architectures such as GPUs. Further, it concentrates computatio ..."
Abstract - Cited by 8 (2 self) - Add to MetaCart
Figure 1: The figure shows a pair of 4K video frames (a,b) and the corresponding optical flow result (d). Our new SimpleFlow algorithm computes the optical flow using only local operations that can be efficiently implemented on parallel architectures such as GPUs. Further, it concentrates

Limitations of Simple Flow Models for the Simulation of Nanoimprint

by H. Teyssèdre, P. Gilormini, G. Régnier , 2013
"... A quick evaluation of the forces involved in nanoimprint would be very helpful in the prevention of mold deflection. Unfortunately, it is shown here that assuming simplified flows may lead to quite incorrect evaluations of these forces, even for simple periodic patterns and a Newtonian behavior. The ..."
Abstract - Add to MetaCart
A quick evaluation of the forces involved in nanoimprint would be very helpful in the prevention of mold deflection. Unfortunately, it is shown here that assuming simplified flows may lead to quite incorrect evaluations of these forces, even for simple periodic patterns and a Newtonian behavior

Abstractions for Software Architecture and Tools to Support Them

by Mary Shaw , Robert DeLine, Daniel V. Klein, Theodore L. Ross, David M. Young, Gregory Zelesnik - IEEE TRANSACTIONS ON SOFTWARE ENGINEERING , 1995
"... Architectures for software use rich abstractions and idioms to describe system components, the nature of interactions among the components, and the patterns that guide the composition of components into systems. These abstractions are higher-level than the elements usually supported by programming ..."
Abstract - Cited by 364 (6 self) - Add to MetaCart
. It supports abstract interactions such as data flow and scheduling on the same footing as simple procedure...

Efficient Fair Queuing using Deficit Round Robin

by M. Shreedhar, George Varghese - SIGCOMM '95 , 1995
"... Fair queuing is a technique that allows each flow passing through a network device to have a fair share of network resources. Previous schemes for fair queuing that achieved nearly perfect fairness were expensive to implement: specifically, the work required to process a packet in these schemes was ..."
Abstract - Cited by 359 (4 self) - Add to MetaCart
Fair queuing is a technique that allows each flow passing through a network device to have a fair share of network resources. Previous schemes for fair queuing that achieved nearly perfect fairness were expensive to implement: specifically, the work required to process a packet in these schemes

New Directions in Traffic Measurement and Accounting

by Cristian Estan, George Varghese , 2001
"... Accurate network traffic measurement is required for accounting, bandwidth provisioning, and detecting DOS attacks. However, keeping a counter to measure the traffic sent by each of a million concurrent flows is too expensive (using SRAM) or slow (using DRAM). The current state-of-the-art (e.g., Cis ..."
Abstract - Cited by 353 (11 self) - Add to MetaCart
showing that a number of simple solutions based on cached counters and classical sampling do not work, we describe two novel and scalable schemes for this purpose which take a constant number of memory references per packet and use a small amount of memory. Further, unlike NetFlow estimates, we have

Mutual Fund Flows and Performance in Rational Markets

by Jonathan B. Berk, Richard C. Green , 2002
"... We develop a simple rational model of active portfolio management that provides a natural benchmark against which to evaluate observed relationship between returns and fund flows. Many effects widely regarded as anomalous are consistent with this simple explanation. In the model, investments with ac ..."
Abstract - Cited by 306 (16 self) - Add to MetaCart
We develop a simple rational model of active portfolio management that provides a natural benchmark against which to evaluate observed relationship between returns and fund flows. Many effects widely regarded as anomalous are consistent with this simple explanation. In the model, investments
Next 10 →
Results 11 - 20 of 13,620
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