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

The classification of certain kind of . . .

by Naoyuki Koike , 2012
"... ..."
Abstract - Add to MetaCart
Abstract not found

A problem concerning the zeros of a certain kind of . . .

by F. Bagemihl, P. Erdős , 1964
"... ..."
Abstract - Add to MetaCart
Abstract not found

Compressive sensing

by Richard Baraniuk - IEEE Signal Processing Mag , 2007
"... The Shannon/Nyquist sampling theorem tells us that in order to not lose information when uniformly sampling a signal we must sample at least two times faster than its bandwidth. In many applications, including digital image and video cameras, the Nyquist rate can be so high that we end up with too m ..."
Abstract - Cited by 696 (62 self) - Add to MetaCart
will learn about a new technique that tackles these issues using compressive sensing [1, 2]. We will replace the conventional sampling and reconstruction operations with a more general linear measurement scheme coupled with an optimization in order to acquire certain kinds of signals at a rate significantly

ON THE DENSITY OF SETS CONTAINING NO k-ELEMENT ARITHMETIC PROGRESSION OF A CERTAIN KIND

by Brian Alspach, T. C. Brown, Pavol Hell , 1976
"... ..."
Abstract - Add to MetaCart
Abstract not found

Friends With Cognitive Benefits: Mental Function Improves After Certain Kinds of Socializing

by unknown authors
"... ScienceDaily (Oct. 28, 2010) — Talking with other people in a friendly way can make it easier to solve common problems, a new University of Michigan study shows. But conversations that are competitive in tone, rather than cooperative, have no cognitive benefits. "This study shows that simply t ..."
Abstract - Add to MetaCart
ScienceDaily (Oct. 28, 2010) — Talking with other people in a friendly way can make it easier to solve common problems, a new University of Michigan study shows. But conversations that are competitive in tone, rather than cooperative, have no cognitive benefits. "This study shows that simply talking to other people, the way you do when you're making friends, can provide mental benefits, " said psychologist Oscar Ybarra, a researcher at the U-M Institute for Social Research (ISR). Ybarra is the lead author of the study, which is forthcoming in the peer-reviewed journal Social Psychological

Dependence, Substance, Explanation A Certain Kind of Trinity: Dependence, Substance, Explanation

by Benjamin Schnieder
"... (8.768 words, including notes & bibliography) ..."
Abstract - Add to MetaCart
(8.768 words, including notes & bibliography)

Comparison of Multiobjective Evolutionary Algorithms: Empirical Results

by Eckart Zitzler, Lothar Thiele, Kalyanmoy Deb , 2000
"... In this paper, we provide a systematic comparison of various evolutionary approaches to multiobjective optimization using six carefully chosen test functions. Each test function involves a particular feature that is known to cause difficulty in the evolutionary optimization process, mainly in conver ..."
Abstract - Cited by 628 (41 self) - Add to MetaCart
in converging to the Pareto-optimal front (e.g., multimodality and deception). By investigating these different problem features separately, it is possible to predict the kind of problems to which a certain technique is or is not well suited. However, in contrast to what was suspected beforehand

ℓ-diversity: Privacy beyond k-anonymity

by Ashwin Machanavajjhala, Daniel Kifer, Johannes Gehrke, Muthuramakrishnan Venkitasubramaniam - IN ICDE , 2006
"... Publishing data about individuals without revealing sensitive information about them is an important problem. In recent years, a new definition of privacy called k-anonymity has gained popularity. In a k-anonymized dataset, each record is indistinguishable from at least k − 1 other records with resp ..."
Abstract - Cited by 672 (13 self) - Add to MetaCart
with respect to certain “identifying ” attributes. In this paper we show using two simple attacks that a k-anonymized dataset has some subtle, but severe privacy problems. First, an attacker can discover the values of sensitive attributes when there is little diversity in those sensitive attributes. This kind

Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties

by Jianqing Fan , Runze Li , 2001
"... Variable selection is fundamental to high-dimensional statistical modeling, including nonparametric regression. Many approaches in use are stepwise selection procedures, which can be computationally expensive and ignore stochastic errors in the variable selection process. In this article, penalized ..."
Abstract - Cited by 948 (62 self) - Add to MetaCart
likelihood approaches are proposed to handle these kinds of problems. The proposed methods select variables and estimate coefficients simultaneously. Hence they enable us to construct confidence intervals for estimated parameters. The proposed approaches are distinguished from others in that the penalty

A crank analog on a certain kind of partition function arising from the cubic continued fraction, preprint

by Byungchan Kim , 2008
"... Abstract. In a series of papers, H.-C. Chan has studied congruence properties of a certain kind of partition function that arises from Ra-manujan’s cubic continued fraction. This partition function a(n), is defined by n=0 a(n)q n = 1(q;q)∞(q2;q2) ∞. In particular, he proved that a(3n + 2) ≡ 0 (mod ..."
Abstract - Cited by 10 (1 self) - Add to MetaCart
Abstract. In a series of papers, H.-C. Chan has studied congruence properties of a certain kind of partition function that arises from Ra-manujan’s cubic continued fraction. This partition function a(n), is defined by n=0 a(n)q n = 1(q;q)∞(q2;q2) ∞. In particular, he proved that a(3n + 2) ≡ 0 (mod
Next 10 →
Results 1 - 10 of 7,612
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