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

A SIMPLE MECHANISM FOR THE ROOMMATE PROBLEM

by Bora Evci, Bora Evciy , 2014
"... A simple mechanism for the roommate problem ..."
Abstract - Add to MetaCart
A simple mechanism for the roommate problem

Modeling TCP Throughput: A Simple Model and its Empirical Validation

by Jitendra Padhye, Victor Firoiu, Don Towsley, Jim Kurose , 1998
"... In this paper we develop a simple analytic characterization of the steady state throughput, as a function of loss rate and round trip time for a bulk transfer TCP flow, i.e., a flow with an unlimited amount of data to send. Unlike the models in [6, 7, 10], our model captures not only the behavior of ..."
Abstract - Cited by 1337 (36 self) - Add to MetaCart
In this paper we develop a simple analytic characterization of the steady state throughput, as a function of loss rate and round trip time for a bulk transfer TCP flow, i.e., a flow with an unlimited amount of data to send. Unlike the models in [6, 7, 10], our model captures not only the behavior

Rapid object detection using a boosted cascade of simple features

by Paul Viola, Michael Jones - ACCEPTED CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION 2001 , 2001
"... This paper describes a machine learning approach for visual object detection which is capable of processing images extremely rapidly and achieving high detection rates. This work is distinguished by three key contributions. The first is the introduction of a new image representation called the " ..."
Abstract - Cited by 3283 (9 self) - Add to MetaCart
is a method for combining increasingly more complex classifiers in a "cascade" which allows background regions of the image to be quickly discarded while spending more computation on promising object-like regions. The cascade can be viewed as an object specific focus-of-attention mechanism

Active Messages: a Mechanism for Integrated Communication and Computation

by Thorsten Von Eicken, David E. Culler, Seth Copen Goldstein, Klaus Erik Schauser , 1992
"... The design challenge for large-scale multiprocessors is (1) to minimize communication overhead, (2) allow communication to overlap computation, and (3) coordinate the two without sacrificing processor cost/performance. We show that existing message passing multiprocessors have unnecessarily high com ..."
Abstract - Cited by 1054 (75 self) - Add to MetaCart
communication costs. Research prototypes of message driven machines demonstrate low communication overhead, but poor processor cost/performance. We introduce a simple communication mechanism, Active Messages, show that it is intrinsic to both architectures, allows cost effective use of the hardware, and offers

Exact Sampling with Coupled Markov Chains and Applications to Statistical Mechanics

by James Gary Propp, David Bruce Wilson , 1996
"... For many applications it is useful to sample from a finite set of objects in accordance with some particular distribution. One approach is to run an ergodic (i.e., irreducible aperiodic) Markov chain whose stationary distribution is the desired distribution on this set; after the Markov chain has ..."
Abstract - Cited by 543 (13 self) - Add to MetaCart
has run for M steps, with M sufficiently large, the distribution governing the state of the chain approximates the desired distribution. Unfortunately it can be difficult to determine how large M needs to be. We describe a simple variant of this method that determines on its own when to stop

Simple Mechanisms and Preferences for Honesty

by Richard Holden, Navin Kartik, Olivier Tercieux , 2012
"... We consider full implementation in general environments when agents have an arbitrarily small preference for honesty. We offer a condition called separable punishment and show that when it holds and there are at least two agents, any social choice function can be implemented by a simple mechanism in ..."
Abstract - Cited by 5 (2 self) - Add to MetaCart
We consider full implementation in general environments when agents have an arbitrarily small preference for honesty. We offer a condition called separable punishment and show that when it holds and there are at least two agents, any social choice function can be implemented by a simple mechanism

LLVM: A compilation framework for lifelong program analysis & transformation

by Chris Lattner, Vikram Adve , 2004
"... ... a compiler framework designed to support transparent, lifelong program analysis and transformation for arbitrary programs, by providing high-level information to compiler transformations at compile-time, link-time, run-time, and in idle time between runs. LLVM defines a common, low-level code re ..."
Abstract - Cited by 852 (20 self) - Add to MetaCart
representation in Static Single Assignment (SSA) form, with several novel features: a simple, language-independent type-system that exposes the primitives commonly used to implement high-level language features; an instruction for typed address arithmetic; and a simple mechanism that can be used to implement

The Simple Economics of Basic Scientific Research

by Richard R. Nelson - Journal of Political Economy , 1959
"... I begin this essay by reflecting on my early paper (Nelson, 1859), and Ken’s (Arrow, 1962), as period pieces. These papers certainly have been influential in shaping the discussion of science and technology policy over the last forty years, at least among economists, but at the time they were writte ..."
Abstract - Cited by 438 (5 self) - Add to MetaCart
recognition that technological advance must be understood as an evolutionary process, and recognition that the institutions involved in that process include much more than the simple market institutions on which economists usually focus. Then I turn to the contemporary policy arena that is the focus

Modeling and performance analysis of bittorrentlike peer-to-peer networks

by Dongyu Qiu, R. Srikant - In SIGCOMM , 2004
"... In this paper, we develop simple models to study the performance of BitTorrent, a second generation peerto-peer (P2P) application. We first present a simple fluid model and study the scalability, performance and efficiency of such a file-sharing mechanism. We then consider the built-in incentive mec ..."
Abstract - Cited by 574 (3 self) - Add to MetaCart
In this paper, we develop simple models to study the performance of BitTorrent, a second generation peerto-peer (P2P) application. We first present a simple fluid model and study the scalability, performance and efficiency of such a file-sharing mechanism. We then consider the built-in incentive

Reduction of simple mechanical systems

by Andrew D. Lewis , 1997
"... An overview is first given of reduction for simple mechanical systems (i.e., those whose Lagrangians are kinetic energy minus potential energy) with symmetry in the case when the action is free. Both Lagrangian and Hamiltonian perspectives are given. 1. Outline These notes are intended to be a sketc ..."
Abstract - Add to MetaCart
An overview is first given of reduction for simple mechanical systems (i.e., those whose Lagrangians are kinetic energy minus potential energy) with symmetry in the case when the action is free. Both Lagrangian and Hamiltonian perspectives are given. 1. Outline These notes are intended to be a
Next 10 →
Results 1 - 10 of 24,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