• 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 32,330
Next 10 →

The Many Aspects of Anticipation

by Roberto Poli - Foresight 2010
"... ..."
Abstract - Cited by 5 (2 self) - Add to MetaCart
Abstract not found

Many Aspects of Defect Theorems

by Tero Harju, Juhani Karhumäki - Theor. Comput. Sci
"... We give a survey and a unified presentation of the defect theorem, its generalizations and recent aspects of interest. In its basic form the defect theorem states that if a set of n words satisfies a nontrivial relation, then these words can be expressed simultaneously as products of at most n 1 wor ..."
Abstract - Cited by 3 (2 self) - Add to MetaCart
We give a survey and a unified presentation of the defect theorem, its generalizations and recent aspects of interest. In its basic form the defect theorem states that if a set of n words satisfies a nontrivial relation, then these words can be expressed simultaneously as products of at most n 1

Some informational aspects of visual perception

by Fred Attneave - Psychol. Rev , 1954
"... The ideas of information theory are at present stimulating many different areas of psychological inquiry. In providing techniques for quantifying situations which have hitherto been difficult or impossible to quantify, they suggest new and more precise ways of conceptualizing these situations (see M ..."
Abstract - Cited by 643 (2 self) - Add to MetaCart
The ideas of information theory are at present stimulating many different areas of psychological inquiry. In providing techniques for quantifying situations which have hitherto been difficult or impossible to quantify, they suggest new and more precise ways of conceptualizing these situations (see

The English Noun Phrase in its Sentential Aspect

by Steven Paul Abney - PH.D. DISSERTATION MIT , 1987
"... This dissertation is a defense of the hypothesis that the noun phrase is headed by a functional element (i.e., "non-lexical" category) D, identified with the determiner. In this way, the structure of the noun phrase parallels that of the sentence, which is headed by Infl(ection), under ass ..."
Abstract - Cited by 532 (4 self) - Add to MetaCart
assumptions now standard within the Government-Binding (GB) framework. The central empirical problem addressed is the question of the proper analysis of the so-called "Poss-ing" gerund in English. This construction possesses simultaneously many properties of sentences, and many properties of noun

Many Aspects of Reliabilities in a Distributed

by Mobile Messaging, Middleware Jms, Eiko Yoneki
"... Abstract. Pronto[19] is a middleware system for mobile applications with JMS messaging as a basis in both centralized and decentralized forms. Asynchronous messaging is essential to support reliable communication with mobile devices. An intelligent gateway and smart caching in Pronto support the con ..."
Abstract - Add to MetaCart
Abstract. Pronto[19] is a middleware system for mobile applications with JMS messaging as a basis in both centralized and decentralized forms. Asynchronous messaging is essential to support reliable communication with mobile devices. An intelligent gateway and smart caching in Pronto support the construction of distributed messaging systems over JMS servers. The main aim of Pronto is to support a reliable and efficient message flow from data source to consumers by applying and comparing different techniques. Pronto provides a solution for mobile application specific problems such as resource constraints, network characteristics, and data optimization, which achieves high reliability in end-to-end communication. 1

Cost-Aware WWW Proxy Caching Algorithms

by Pei Cao, Sandy Irani - IN PROCEEDINGS OF THE 1997 USENIX SYMPOSIUM ON INTERNET TECHNOLOGY AND SYSTEMS , 1997
"... Web caches can not only reduce network traffic and downloading latency, but can also affect the distribution of web traffic over the network through costaware caching. This paper introduces GreedyDualSize, which incorporates locality with cost and size concerns in a simple and non-parameterized fash ..."
Abstract - Cited by 540 (6 self) - Add to MetaCart
-parameterized fashion for high performance. Trace-driven simulations show that with the appropriate cost definition, GreedyDual-Size outperforms existing web cache replacement algorithms in many aspects, including hit ratios, latency reduction and network cost reduction. In addition, GreedyDual-Size can potentially

The Google File System

by Sanjay Ghemawat, Howard Gobioff, Shun-tak Leung - ACM SIGOPS OPERATING SYSTEMS REVIEW , 2003
"... We have designed and implemented the Google File System, a scalable distributed file system for large distributed data-intensive applications. It provides fault tolerance while running on inexpensive commodity hardware, and it delivers high aggregate performance to a large number of clients. While s ..."
Abstract - Cited by 1501 (3 self) - Add to MetaCart
, discuss many aspects of our design, and report measurements from both micro-benchmarks and real world use.

A distributed, developmental model of word recognition and naming

by Mark S. Seidenberg, James L. McClelland - PSYCHOLOGICAL REVIEW , 1989
"... A parallel distributed processing model of visual word recognition and pronunciation is described. The model consists of sets of orthographic and phonological units and an interlevel of hidden units. Weights on connections between units were modified during a training phase using the back-propagatio ..."
Abstract - Cited by 706 (49 self) - Add to MetaCart
-propagation learning algorithm. The model simulates many aspects of human performance, including (a) differences between words in terms of processing difficulty, (b) pronunciation of novel items, (c) differences between readers in terms of word recognition skill, (d) transitions from beginning to skilled reading

Pseudo-Random Generation from One-Way Functions

by Johan Håstad, Russell Impagliazzo, Leonid A. Levin, Michael Luby - PROC. 20TH STOC , 1988
"... Pseudorandom generators are fundamental to many theoretical and applied aspects of computing. We show howto construct a pseudorandom generator from any oneway function. Since it is easy to construct a one-way function from a pseudorandom generator, this result shows that there is a pseudorandom gene ..."
Abstract - Cited by 861 (18 self) - Add to MetaCart
Pseudorandom generators are fundamental to many theoretical and applied aspects of computing. We show howto construct a pseudorandom generator from any oneway function. Since it is easy to construct a one-way function from a pseudorandom generator, this result shows that there is a pseudorandom

The Many Aspects of Counting Lattice Points In Polytopes

by Jesús A. De Loera
"... A wide variety of topics in pure and applied mathematics involve the problem of counting the number of lattice points inside a convex bounded polyhedron, for short called a polytope. Applications range from the very pure (number theory, toric Hilbert functions, Kostant’s partition function in repre ..."
Abstract - Cited by 24 (2 self) - Add to MetaCart
A wide variety of topics in pure and applied mathematics involve the problem of counting the number of lattice points inside a convex bounded polyhedron, for short called a polytope. Applications range from the very pure (number theory, toric Hilbert functions, Kostant’s partition function in representation theory) to the most applied (cryptography, integer programming, contingency tables). This paper is a survey of this problem and its applications. We review the basic structure theorems about this type of counting problem. Perhaps the most famous special case is the theory of Ehrhart polynomials, introduced in the 1960s by Eugène Ehrhart. These polynomials count the number of lattice points in the different integral dilations of an integral convex polytope. We discuss recent algorithmic solutions to this problem and conclude with a look at what happens when trying to count lattice points in more complicated regions of space.
Next 10 →
Results 1 - 10 of 32,330
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