• 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 247,134
Next 10 →

OBTAINED RESULTS

by Popa A, Dunoiu A, Genoiu C, A. I. Cuza Str, Key Words
"... Romania, as a member of the International Organization of Vine and Wine (O.I.V.-Vine and Wine Organization) since 1927, has permanently acted for the practice, into its vineyards, for a quality viticulture and oenology, taking France and Italy for models, as they are world leaders in wines, respecti ..."
Abstract - Add to MetaCart
's expansion, the unitary survey of the European viticultural space, the adoption of viticultural models that rely on the specific paedological, climatic, varietal and human resources of each zone; the strict delimitation of the areas where are obtained the DOC-IC (C.O.D.-H.Q.; Controlled Origin Denomination

A method for obtaining digital signatures and public-key cryptosystems.

by R L Rivest , A Shamir , L Adleman - Communications of the ACM, , 1978
"... Abstract An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key. This has two important consequences: 1. Couriers or other secure means are not needed to transmit keys, since a message can be encip ..."
Abstract - Cited by 3894 (24 self) - Add to MetaCart
to a publicly specified power e, and then taking the remainder when the result is divided by the publicly specified product, n, of two large secret prime numbers p and q. Decryption is similar; only a different, secret, power d is used, where e · d ≡ 1 (mod (p − 1) · (q − 1)). The security

Evaluating the use of exploratory factor analysis in psychological research

by Leandre R. Fabrigar, Duane T. Wegener, Robert C. MacCallum, Erin J. Strahan - PSYCHOLOGICAL METHODS , 1999
"... Despite the widespread use of exploratory factor analysis in psychological research, researchers often make questionable decisions when conducting these analyses. This article reviews the major design and analytical decisions that must be made when conducting a factor analysis and notes that each of ..."
Abstract - Cited by 524 (4 self) - Add to MetaCart
of these decisions has important consequences for the obtained results. Recommendations that have been made in the methodological literature are discussed. Analyses of 3 existing empirical data sets are used to illustrate how questionable decisions in conducting factor analyses can yield problematic results

Term-weighting approaches in automatic text retrieval

by Gerard Salton, Christopher Buckley - INFORMATION PROCESSING AND MANAGEMENT , 1988
"... The experimental evidence accumulated over the past 20 years indicates that text indexing systems based on the assignment of appropriately weighted single terms produce retrieval results that are superior to those obtainable with other more elaborate text representations. These results depend crucia ..."
Abstract - Cited by 2189 (10 self) - Add to MetaCart
The experimental evidence accumulated over the past 20 years indicates that text indexing systems based on the assignment of appropriately weighted single terms produce retrieval results that are superior to those obtainable with other more elaborate text representations. These results depend

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
mechanism of Bit-Torrent and study its effect on network performance. We also provide numerical results based on both simulations and real traces obtained from the Internet. 1

PROBABILITY INEQUALITIES FOR SUMS OF BOUNDED RANDOM VARIABLES

by Wassily Hoeffding , 1962
"... Upper bounds are derived for the probability that the sum S of n independent random variables exceeds its mean ES by a positive number nt. It is assumed that the range of each summand of S is bounded or bounded above. The bounds for Pr(S-ES> nt) depend only on the endpoints of the ranges of the s ..."
Abstract - Cited by 2215 (2 self) - Add to MetaCart
of the smumands and the mean, or the mean and the variance of S. These results are then used to obtain analogous inequalities for certain sums of dependent random variables such as U statistics and the sum of a random sample without replacement from a finite population.

DiamondTouch: a multi-user touch technology

by Paul Dietz, Darren Leigh , 2003
"... A technique for creating touch sensitive surfaces is proposed which allows multiple, simultaneous users to interact in an intuitive fashion. Touch location information is determined independently for each user, allowing each touch on the common surface to be associated with a particular user. The su ..."
Abstract - Cited by 591 (8 self) - Add to MetaCart
. The surface gnerates location dependent electric fields, which are capacitively coupled through the users to receivers installed in the work environment. We describe the design of these sytems and their applications. Finally, we conclude with a description of the results we have obtained with a first

Learning with local and global consistency.

by Dengyong Zhou , Olivier Bousquet , Thomas Navin Lal , Jason Weston , Bernhard Schölkopf - In NIPS, , 2003
"... Abstract We consider the general problem of learning from labeled and unlabeled data, which is often called semi-supervised learning or transductive inference. A principled approach to semi-supervised learning is to design a classifying function which is sufficiently smooth with respect to the intr ..."
Abstract - Cited by 673 (21 self) - Add to MetaCart
to the intrinsic structure collectively revealed by known labeled and unlabeled points. We present a simple algorithm to obtain such a smooth solution. Our method yields encouraging experimental results on a number of classification problems and demonstrates effective use of unlabeled data.

Mining Association Rules between Sets of Items in Large Databases

by Rakesh Agrawal, Tomasz Imielinski, Arun Swami - IN: PROCEEDINGS OF THE 1993 ACM SIGMOD INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA, WASHINGTON DC (USA , 1993
"... We are given a large database of customer transactions. Each transaction consists of items purchased by a customer in a visit. We present an efficient algorithm that generates all significant association rules between items in the database. The algorithm incorporates buffer management and novel esti ..."
Abstract - Cited by 3331 (16 self) - Add to MetaCart
estimation and pruning techniques. We also present results of applying this algorithm to sales data obtained from a large retailing company, which shows the effectiveness of the algorithm.

Capacity of Fading Channels with Channel Side Information

by Andrea J. Goldsmith , et al. , 1997
"... We obtain the Shannon capacity of a fading channel with channel side information at the transmitter and receiver, and at the receiver alone. The optimal power adaptation in the former case is "water-pouring" in time, analogous to water-pouring in frequency for time-invariant frequency-sele ..."
Abstract - Cited by 586 (20 self) - Add to MetaCart
We obtain the Shannon capacity of a fading channel with channel side information at the transmitter and receiver, and at the receiver alone. The optimal power adaptation in the former case is "water-pouring" in time, analogous to water-pouring in frequency for time-invariant frequency
Next 10 →
Results 1 - 10 of 247,134
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