• 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 5,133
Next 10 →

Data Streams: Algorithms and Applications

by S. Muthukrishnan , 2005
"... In the data stream scenario, input arrives very rapidly and there is limited memory to store the input. Algorithms have to work with one or few passes over the data, space less than linear in the input size or time significantly less than the input size. In the past few years, a new theory has emerg ..."
Abstract - Cited by 533 (22 self) - Add to MetaCart
In the data stream scenario, input arrives very rapidly and there is limited memory to store the input. Algorithms have to work with one or few passes over the data, space less than linear in the input size or time significantly less than the input size. In the past few years, a new theory has

A tutorial on particle filters for online nonlinear/non-Gaussian Bayesian tracking

by M. Sanjeev Arulampalam, Simon Maskell, Neil Gordon - IEEE TRANSACTIONS ON SIGNAL PROCESSING , 2002
"... Increasingly, for many application areas, it is becoming important to include elements of nonlinearity and non-Gaussianity in order to model accurately the underlying dynamics of a physical system. Moreover, it is typically crucial to process data on-line as it arrives, both from the point of view o ..."
Abstract - Cited by 2006 (2 self) - Add to MetaCart
Increasingly, for many application areas, it is becoming important to include elements of nonlinearity and non-Gaussianity in order to model accurately the underlying dynamics of a physical system. Moreover, it is typically crucial to process data on-line as it arrives, both from the point of view

Promoting the Use of End-to-End Congestion Control in the Internet

by Sally Floyd, Kevin Fall - IEEE/ACM TRANSACTIONS ON NETWORKING , 1999
"... This paper considers the potentially negative impacts of an increasing deployment of non-congestion-controlled best-effort traffic on the Internet.’ These negative impacts range from extreme unfairness against competing TCP traffic to the potential for congestion collapse. To promote the inclusion ..."
Abstract - Cited by 875 (14 self) - Add to MetaCart
of end-to-end congestion control in the design of future protocols using best-effort traffic, we argue that router mechanisms are needed to identify and restrict the bandwidth of selected high-bandwidth best-effort flows in times of congestion. The paper discusses several general approaches

Toward an instance theory of automatization

by Gordon D. Logan - Psychological Review , 1988
"... This article presents a theory in which automatization is construed as the acquisition of a domain-specific knowledge base, formed of separate representations, instances, of each exposure to the task. Processing is considered automatic if it relies on retrieval of stored instances, which will occur ..."
Abstract - Cited by 647 (38 self) - Add to MetaCart
-up and predicts a power-function reduction in the standard deviation that is constrained to have the same exponent as the power function for the speed-up. The theory accounts for qualitative properties as well, explaining how some may disappear and others appear with practice. More generally, it provides

Random Early Detection Gateways for Congestion Avoidance.

by Sally Floyd , Van Jacobson - IEEELACM Transactions on Networking, , 1993
"... Abstract-This paper presents Random Early Detection (RED) gateways for congestion avoidance in packet-switched networks. The gateway detects incipient congestion by computing the average queue size. The gateway could notify connections of congestion either by dropping packets arriving at the gatewa ..."
Abstract - Cited by 2716 (31 self) - Add to MetaCart
Abstract-This paper presents Random Early Detection (RED) gateways for congestion avoidance in packet-switched networks. The gateway detects incipient congestion by computing the average queue size. The gateway could notify connections of congestion either by dropping packets arriving

Performance Evaluation of a Single Node with General Arrivals and Service

by Alexandre Brandwajn, Thomas Begin
"... Queueing delays experienced by packets buffered at a node are among the most difficult to predict when considering the performance of a flow in a network. The arrivals of packets at a node tend to be highly variable so that a finite-buffer single-server queue with general arrivals and service emerg ..."
Abstract - Add to MetaCart
Queueing delays experienced by packets buffered at a node are among the most difficult to predict when considering the performance of a flow in a network. The arrivals of packets at a node tend to be highly variable so that a finite-buffer single-server queue with general arrivals and service

Measuring the information content of stock trades

by Joel Hasbrouck - Journal of Finance , 1991
"... This paper suggests that the interactions of security trades and quote revisions be modeled as a vector autoregressive system. Within this framework, a trade's information effect may be meaningfully measured as the ultimate price impact of the trade innovation. Estimates for a sample of NYSE is ..."
Abstract - Cited by 469 (11 self) - Add to MetaCart
issues suggest: a trade's full price impact arrives only with a protracted lag; the impact is a positive and concave function of the trade size; large trades cause the spread to widen; trades occurring in the face of wide spreads have larger price impacts; and, information asymmetries are more

Applying New Scheduling Theory to Static Priority Pre-Emptive Scheduling

by N. Audsley, A. Burns, M. Richardson, K. Tindell, A. J. Wellings - Software Engineering Journal , 1993
"... The paper presents exact schedulability analyses for real-time systems scheduled at run-time with a static priority pre-emptive dispatcher. The tasks to be scheduled are allowed to experience internal blocking (from other tasks with which they share resources) and (with certain restrictions) release ..."
Abstract - Cited by 448 (64 self) - Add to MetaCart
) release jitter — such as waiting for a message to arrive. The analysis presented is more general than that previously published, and subsumes, for example, techniques based on the Rate Monotonic approach. In addition to presenting the theory, an existing avionics case study is described and analysed

Polling on a Graph with General Arrival and Service Time Distribution

by Eitan Altman, Serguei Foss , 1993
"... We consider a polling system on a graph with general independent arrival, service and walking times. We present necessary and sufficient conditions for stability, based on drift analysis of both the workload and the residual interarrival times within some embedded times called cycles. ..."
Abstract - Cited by 4 (0 self) - Add to MetaCart
We consider a polling system on a graph with general independent arrival, service and walking times. We present necessary and sufficient conditions for stability, based on drift analysis of both the workload and the residual interarrival times within some embedded times called cycles.

Heavy traffic approximations of a queue with varying service rates and general arrivals ∗†‡

by Robert Buche, Arka P. Ghosh, Vladas Pipiras , 2009
"... Heavy traffic limit theorems are established for a class of single server queueing models including those with heavy-tailed or long-range dependent arrivals and time-varying service rates. The models are motivated by wireless queueing systems for which there is an increasing evidence of the presence ..."
Abstract - Add to MetaCart
Heavy traffic limit theorems are established for a class of single server queueing models including those with heavy-tailed or long-range dependent arrivals and time-varying service rates. The models are motivated by wireless queueing systems for which there is an increasing evidence
Next 10 →
Results 1 - 10 of 5,133
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