• 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 103,111
Next 10 →

Five misunderstandings about case-study research

by Bent Flyvbjerg - Qualitative Inquiry , 2006
"... When I first became interested in in-depth case-study research, I was trying to understand how power and rationality shape each other and form the urban environments in which we live (Flyvbjerg, 1998). It was clear to me that in order to understand a complex issue like this, in-depth case-study rese ..."
Abstract - Cited by 556 (2 self) - Add to MetaCart
When I first became interested in in-depth case-study research, I was trying to understand how power and rationality shape each other and form the urban environments in which we live (Flyvbjerg, 1998). It was clear to me that in order to understand a complex issue like this, in-depth case

A generalized processor sharing approach to flow control in integrated services networks: The single-node case

by Abhay K. Parekh, Robert G. Gallager - IEEE/ACM TRANSACTIONS ON NETWORKING , 1993
"... The problem of allocating network resources to the users of an integrated services network is investigated in the context of rate-based flow control. The network is assumed to be a virtual circuit, connection-based packet network. We show that the use of Generalized processor Sharing (GPS), when co ..."
Abstract - Cited by 2010 (5 self) - Add to MetaCart
combined with Leaky Bucket admission control, allows the network to make a wide range of worst-case performance guarantees on throughput and delay. The scheme is flexible in that different users may be given widely different performance guarantees, and is efficient in that each of the servers is work

of the first case

by Nidal A Obaidat, Danny M Ghazarian
"... utaneous adnexal tumours are largely benign lesions, and are typically classified according to their state of appendageal differentiation as eccrine, apocrine, follicular and sebaceous.1 2 However, rare tumours may display a mixture of eccrine, follicular, sebaceous and apocrine differentiation. Suc ..."
Abstract - Add to MetaCart
utaneous adnexal tumours are largely benign lesions, and are typically classified according to their state of appendageal differentiation as eccrine, apocrine, follicular and sebaceous.1 2 However, rare tumours may display a mixture of eccrine, follicular, sebaceous and apocrine differentiation. Such tumours with varied differentiation are relatively rare.3–9 The term ‘‘combined adnexal tumours of the skin’ ’ was proposed by Apisarnthanarax et al.3 Other synonyms include ‘‘benign adnexal tumour with multi-directional differentia-tion’’8 and ‘‘benign adnexal tumour of mixed lineage’’.1 Clinically, these tumours present as solitary, slowly enlarging dermal or subcutaneous nodules located in the head and neck and in the extremities.1 8 Histologically, they are characterised by well-circumscribed, non-encapsulated nodules composed of a lobular proliferation of epithelial cells displaying a spectrum

the first case

by Jayme Augusto Bertelli, Jayme Augusto Bertelli , 2007
"... This is an Open Access article distributed under the terms of the Creative Commons Attribution License ..."
Abstract - Add to MetaCart
This is an Open Access article distributed under the terms of the Creative Commons Attribution License

The Semantics of Predicate Logic as a Programming Language

by M. H. Van Emden, R. A. Kowalski - JOURNAL OF THE ACM , 1976
"... Sentences in first-order predicate logic can be usefully interpreted as programs In this paper the operational and fixpoint semantics of predicate logic programs are defined, and the connections with the proof theory and model theory of logic are investigated It is concluded that operational seman ..."
Abstract - Cited by 808 (18 self) - Add to MetaCart
Sentences in first-order predicate logic can be usefully interpreted as programs In this paper the operational and fixpoint semantics of predicate logic programs are defined, and the connections with the proof theory and model theory of logic are investigated It is concluded that operational

Locality-sensitive hashing scheme based on p-stable distributions

by Mayur Datar, Piotr Indyk - In SCG ’04: Proceedings of the twentieth annual symposium on Computational geometry , 2004
"... inÇÐÓ�Ò We present a novel Locality-Sensitive Hashing scheme for the Approximate Nearest Neighbor Problem underÐÔnorm, based onÔstable distributions. Our scheme improves the running time of the earlier algorithm for the case of theÐnorm. It also yields the first known provably efficient approximate ..."
Abstract - Cited by 521 (8 self) - Add to MetaCart
inÇÐÓ�Ò We present a novel Locality-Sensitive Hashing scheme for the Approximate Nearest Neighbor Problem underÐÔnorm, based onÔstable distributions. Our scheme improves the running time of the earlier algorithm for the case of theÐnorm. It also yields the first known provably efficient approximate

Games with Incomplete Information Played by 'Bayesian' Players, I-III

by John C Harsanyi - MANAGEMENT SCIENCE , 1967
"... The paper develops a new theory for the analysis of games with incomplete information where the players are uncertain about some important parameters of the game situation, such as the payoff functions, the strategies available to various players, the information other players have about the game, e ..."
Abstract - Cited by 787 (2 self) - Add to MetaCart
In cases where the consistencj assumption holds, the original game can be replaced by a game where nature first conducts a lottery in accordance with

An Efficient Boosting Algorithm for Combining Preferences

by Raj Dharmarajan Iyer , Jr. , 1999
"... The problem of combining preferences arises in several applications, such as combining the results of different search engines. This work describes an efficient algorithm for combining multiple preferences. We first give a formal framework for the problem. We then describe and analyze a new boosting ..."
Abstract - Cited by 727 (18 self) - Add to MetaCart
boosting algorithm for combining preferences called RankBoost. We also describe an efficient implementation of the algorithm for certain natural cases. We discuss two experiments we carried out to assess the performance of RankBoost. In the first experiment, we used the algorithm to combine different WWW

Trade Liberalization, Exit, and Productivity Improvements: Evidence from Chilean Plants

by Nina Pavcnik - Review of Economic Studies , 2002
"... This paper empirically investigates the effects of liberalized trade on plant productivity in the case of Chile. Chile presents an interesting setting to study this relationship since it underwent a massive trade liberalization that significantly exposed its plants to competition from abroad during ..."
Abstract - Cited by 555 (16 self) - Add to MetaCart
This paper empirically investigates the effects of liberalized trade on plant productivity in the case of Chile. Chile presents an interesting setting to study this relationship since it underwent a massive trade liberalization that significantly exposed its plants to competition from abroad during

XORs in the air: practical wireless network coding

by Sachin Katti, Hariharan Rahul, Wenjun Hu, Dina Katabi, Muriel Médard, Jon Crowcroft - In Proc. ACM SIGCOMM , 2006
"... This paper proposes COPE, a new architecture for wireless mesh networks. In addition to forwarding packets, routers mix (i.e., code) packets from different sources to increase the information content of each transmission. We show that intelligently mixing packets increases network throughput. Our de ..."
Abstract - Cited by 548 (20 self) - Add to MetaCart
design is rooted in the theory of network coding. Prior work on network coding is mainly theoretical and focuses on multicast traffic. This paper aims to bridge theory with practice; it addresses the common case of unicast traffic, dynamic and potentially bursty flows, and practical issues facing
Next 10 →
Results 1 - 10 of 103,111
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