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

. The results showed that the

by Stella Yen Ling, Marcus Jopony, Al, Or Al
"... Abstract: The efficacy of neutralization of an acidic aqueous solution is generally dependent on the type of alkaline material used. However, another limiting factor but often overlooked is the presence of dissolved metals. In this study, the effect of Fe ..."
Abstract - Add to MetaCart
Abstract: The efficacy of neutralization of an acidic aqueous solution is generally dependent on the type of alkaline material used. However, another limiting factor but often overlooked is the presence of dissolved metals. In this study, the effect of Fe

Greed is Good: Algorithmic Results for Sparse Approximation

by Joel A. Tropp , 2004
"... This article presents new results on using a greedy algorithm, orthogonal matching pursuit (OMP), to solve the sparse approximation problem over redundant dictionaries. It provides a sufficient condition under which both OMP and Donoho’s basis pursuit (BP) paradigm can recover the optimal representa ..."
Abstract - Cited by 916 (9 self) - Add to MetaCart
This article presents new results on using a greedy algorithm, orthogonal matching pursuit (OMP), to solve the sparse approximation problem over redundant dictionaries. It provides a sufficient condition under which both OMP and Donoho’s basis pursuit (BP) paradigm can recover the optimal

The file drawer problem and tolerance for null results

by Robert Rosenthal - Psychological Bulletin , 1979
"... For any given research area, one cannot tell how many studies have been con-ducted but never reported. The extreme view of the "file drawer problem " is that journals are filled with the 5 % of the studies that show Type I errors, while the file drawers are filled with the 95 % of the stud ..."
Abstract - Cited by 497 (0 self) - Add to MetaCart
% of the studies that show non-significant results. Quantitative procedures for computing the tolerance for filed and future null results are reported and illustrated, and the implications are discussed. Both behavioral researchers and statisti-cians have long suspected that the studies published in the behavioral

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

Analysis of TCP Performance over Mobile Ad Hoc Networks Part I: Problem Discussion and Analysis of Results

by Gavin Holland, Nitin Vaidya , 1999
"... Mobile ad hoc networks have gained a lot of attention lately as a means of providing continuous network connectivity to mobile computing devices regardless of physical location. Recently, a large amount of research has focused on the routing protocols needed in such an environment. In this two-part ..."
Abstract - Cited by 521 (5 self) - Add to MetaCart
-part report, we investigate the effects that link breakage due to mobility has on TCP performance. Through simulation, we show that TCP throughput drops significantly when nodes move because of TCP's inability to recognize the difference between link failure and congestion. We also analyze specific

RESULTS: The results showed that EDNRB (en-

by unknown authors , 1582
"... Abstract. – BACKGROUND: Lung adenocarci-noma (LAC) is the most frequent histologic type of lung cancer and rates of adenocarcinoma are in-creasing in most countries. Recently, several mole-cular markers have been identified to predict LAC. However, more prognostic makers and the underly-ing role of ..."
Abstract - Add to MetaCart
Abstract. – BACKGROUND: Lung adenocarci-noma (LAC) is the most frequent histologic type of lung cancer and rates of adenocarcinoma are in-creasing in most countries. Recently, several mole-cular markers have been identified to predict LAC. However, more prognostic makers and the underly-ing role of those makers are still imperative. AIM: In this study, our objective was to identify a set of discriminating genes that can be used for characterization and prediction of response to LAC. MATERIALS AND METHODS: Using the bioinfor-matics analysis method, we merged two LAC datasets-GSE2514 and GSE7670 to find novel target genes and pathways to explain the pathogenicity.

Panel Cointegration; Asymptotic and Finite Sample Properties of Pooled Time Series Tests, With an Application to the PPP Hypothesis; New Results. Working paper

by Peter Pedroni , 1997
"... We examine properties of residual-based tests for the null of no cointegration for dynamic panels in which both the short-run dynamics and the long-run slope coefficients are permitted to be heterogeneous across individual members of the panel+ The tests also allow for individual heterogeneous fixed ..."
Abstract - Cited by 529 (13 self) - Add to MetaCart
fixed effects and trend terms, and we consider both pooled within dimension tests and group mean between dimension tests+ We derive limiting distributions for these and show that they are normal and free of nuisance parameters+ We also provide Monte Carlo evidence to demonstrate their small sample size

Memory Coherence in Shared Virtual Memory Systems

by Kai Li, Paul Hudak , 1989
"... This paper studies the memory coherence problem in designing said inaplementing a shared virtual memory on looselycoupled multiprocessors. Two classes of aIgoritb. ms for solving the problem are presented. A prototype shared virtual memory on an Apollo ring has been implemented based on these a ..."
Abstract - Cited by 957 (17 self) - Add to MetaCart
on these algorithms. Both theoretical and practical results show tkat the mentory coherence problem cast indeed be solved efficiently on a loosely-coupled multiprocessor.

Automatic Retrieval and Clustering of Similar Words

by Dekang Lin , 1998
"... greatest challenges in natural language learning. We first define a word similarity measure based on the distributional pattern of words. The similarity measure allows us to construct a thesaurus using a parsed corpus. We then present a new evaluation methodology for the automatically constructed th ..."
Abstract - Cited by 943 (15 self) - Add to MetaCart
the- saurus. The evaluation results show that the the- saurus is significantly closer to WordNet than Roget Thesaurus is.

Automatic verification of finite-state concurrent systems using temporal logic specifications

by E. M. Clarke, E. A. Emerson, A. P. Sistla - ACM Transactions on Programming Languages and Systems , 1986
"... We give an efficient procedure for verifying that a finite-state concurrent system meets a specification expressed in a (propositional, branching-time) temporal logic. Our algorithm has complexity linear in both the size of the specification and the size of the global state graph for the concurrent ..."
Abstract - Cited by 1388 (62 self) - Add to MetaCart
system. We also show how this approach can be adapted to handle fairness. We argue that our technique can provide a practical alternative to manual proof construction or use of a mechanical theorem prover for verifying many finite-state concurrent systems. Experimental results show that state machines
Next 10 →
Results 1 - 10 of 539,439
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