• 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 3,039
Next 10 →

The Nature and Growth of Vertical Specialization in World Trade

by David Hummels - Journal of International Economics
"... Abstract: Dramatic changes are occurring in the nature of international trade. Production processes increasingly involve a sequential, vertical trading chain stretching across many countries, with each country specializing in particular stages of a good’s production sequence. We document a key aspe ..."
Abstract - Cited by 481 (20 self) - Add to MetaCart
and transport costs can lead to extensive vertical specialization, large trade growth, and large gains from trade. We formally illustrate these points by developing an extension of the Dornbusch-Fischer-Samuelson Ricardian trade model.

Do Vertical Extension and Horizontal Mergers Interact

by Claire Chambolle, Eric Giraud-héraud, Claire Chambolle, Cahier N
"... Cet article analyse les relations entre les incitations des distributeurs à fusionner et celles des producteurs à développer leur filière de distribution directe (extension verticale). En supposant que les consommateurs différencient la qualité du service offerte par les différents canaux de distrib ..."
Abstract - Add to MetaCart
points out three causal links: (i) retailers may choose to remain separated to avoid the producer's vertical extension, (ii)

The click modular router

by Eddie Kohler , 2001
"... Click is a new software architecture for building flexible and configurable routers. A Click router is assembled from packet processing modules called elements. Individual elements implement simple router functions like packet classification, queueing, scheduling, and interfacing with network devic ..."
Abstract - Cited by 1167 (28 self) - Add to MetaCart
devices. A router configuration is a directed graph with elements at the vertices; packets flow along the edges of the graph. Configurations are written in a declarative language that supports user-defined abstractions. This language is both readable by humans and easily manipulated by tools. We present

Distortion invariant object recognition in the dynamic link architecture

by Martin Lades, Jan C. Vorbrüggen, Joachim Buhmann, Christoph v. d. Malsburg, Rolf P. Würtz, Wolfgang Konen - IEEE TRANSACTIONS ON COMPUTERS , 1993
"... We present an object recognition system based on the Dynamic Link Architecture, which is an extension to classical Artificial Neural Networks. The Dynamic Link Architecture ex-ploits correlations in the fine-scale temporal structure of cellular signals in order to group neurons dynamically into hig ..."
Abstract - Cited by 637 (80 self) - Add to MetaCart
We present an object recognition system based on the Dynamic Link Architecture, which is an extension to classical Artificial Neural Networks. The Dynamic Link Architecture ex-ploits correlations in the fine-scale temporal structure of cellular signals in order to group neurons dynamically

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
that respect the metric of the (possibly weighted) graph. Given a graph G we map its vertices to a normed space in an attempt to (i) Keep down the dimension of the host space and (ii) Guarantee a small distortion, i.e., make sure that distances between vertices in G closely match the dis-tances between

A fast procedure for computing the distance between complex objects in three space

by Elmer G. Gilbert, Daniel W. Johnson, S. Sathiya Keerthi - in Proc. IEEE Int. Conf. on Robotics and Automation , 1987
"... Abstract-An efficient and reliable algorithm for computing the Euclidean distance between a pair of convex sets in Rm is described. Extensive numerical experience with a broad family of polytopes in R3 shows that the computational cost is approximately linear in the total number of vertices specifyi ..."
Abstract - Cited by 356 (10 self) - Add to MetaCart
Abstract-An efficient and reliable algorithm for computing the Euclidean distance between a pair of convex sets in Rm is described. Extensive numerical experience with a broad family of polytopes in R3 shows that the computational cost is approximately linear in the total number of vertices

Vertical Handoffs in Wireless Overlay Networks

by Mark Stemm , 1996
"... We present extensions to a traditional cellular [Ses95] handoff system to handle the simultaneous operation of multiple wireless network interfaces. This new system allows mobile users to roam in a "Wireless Overlay Network" structure consisting of room-size, building-size, and wide-area d ..."
Abstract - Cited by 252 (4 self) - Add to MetaCart
We present extensions to a traditional cellular [Ses95] handoff system to handle the simultaneous operation of multiple wireless network interfaces. This new system allows mobile users to roam in a "Wireless Overlay Network" structure consisting of room-size, building-size, and wide

Vertical

by Alexis M. Tourapis, Oscar C. Au, Ming L. Liou, Frame N
"... This paper describes a new highly efficient deinterlacing approach based on motion estimation and compensation techniques. The proposed technique mainly benefits from the motion vector properties of zonal based algorithms, such as the Advanced Predictive Diamond Zonal Search (APDZS) and the Predicti ..."
Abstract - Add to MetaCart
) and the Predictive Motion Vector Field Adaptive Search Technique (PMVFAST), multihypothesis motion compensation, but also an additional motion classification phase where, depending on the motion of a pixel, additional spatial and temporal information is also considered to further improve performance. Extensive

2003: A global simulation of tropospheric ozone and related tracers: Description and evaluation of MOZART, version 2

by Larry W. Horowitz, Lwh@gfdl. Noaa. Gov, S. Walters, D. L. Mauzerall, L. K. Emmons, P. J. Rasch, C. Granier, X. Tie, J. -f. Lamarque, M. Schultz, G. P. Brasseur - Journal of Geophysical Research (Atmospheres
"... We have developed a global three-dimensional chemical transport model to simulate tropospheric ozone and its precursors. The model, called MOZART-2 (Model for OZone and Related chemical Tracers, version 2), includes a detailed representation of ozone-NO x-NMHC chemistry. The model is built on the fr ..."
Abstract - Cited by 239 (41 self) - Add to MetaCart
on the framework of the NCAR MATCH transport model, and can be run using a variety meteorogical input datasets. Surface emissions are based on recent emission inventories. We have extensively evaluated the results of MOZART-2 by comparison with observations. MOZART-2 successfully simulates most features

Range Effects on Vertical Brand Extensions

by Colin Jevons , Mauricio Palmeira , Nicolas Pontes , Monash University , Australia , Colin Jevons , Mauricio Palmeira , Nicolas , Zhihong Yi , Jing Jian Xiao , June Cotte , Duluth, MN : Linda Price , 2011
"... Drawing on research on range-frequency theory we investigate the effects of price point distance and parent brand's price range on evaluations of vertical extensions. In a series of three experiments we firstly show that price distance has an asymmetric effect of extension evaluation, such tha ..."
Abstract - Add to MetaCart
Drawing on research on range-frequency theory we investigate the effects of price point distance and parent brand's price range on evaluations of vertical extensions. In a series of three experiments we firstly show that price distance has an asymmetric effect of extension evaluation
Next 10 →
Results 1 - 10 of 3,039
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