Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Blockin L

Known as: Blocklin L, Blocklin-L 
 
National Institutes of Health

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2016
Highly Cited
2016
Modern next generation sequencing technologies produce vast amounts of data in the context of large-scale metagenomic studies, in… Expand
Highly Cited
2014
Highly Cited
2014
Taking their motivation from the perceived failure of the reductive physicalist project concerning consciousness, panpsychists… Expand
Highly Cited
2012
Highly Cited
2012
AbstractThe following sections are included:The Great Leveraging: Five Facts and Five Lessons for PolicymakersFact 1. Crises… Expand
Highly Cited
2012
Highly Cited
2012
This paper examines a common belief that learners of English as a foreign language prefer to learn English from native-­‐speaker… Expand
Highly Cited
2006
Highly Cited
2006
This paper proposes a new tree-based ensemble method for supervised classification and regression problems. It essentially… Expand
  • table 1
  • table 2
  • figure 1
  • table 3
  • table 4
Highly Cited
2006
Highly Cited
2006
Conceptual and algorithmic tools are developed as a foundation for a theory of scheduling complex computation-dags for Internet… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Highly Cited
2002
Highly Cited
2002
In simple terms, one can say that team coaching in adversarial domains consists of providing advice to distributed players to… Expand
  • figure 1
  • figure 2
Highly Cited
2001
Highly Cited
2001
In this work, we consider term rewriting from a functional point of view. A rewrite rule is a function that can be applied to a… Expand
  • figure 1
  • figure 2
2001
2001
  • Jee Hea An
  • IACR Cryptol. ePrint Arch.
  • 2001
  • Corpus ID: 1608753
Se urity Notions and Analyses Jee Hea An Abstra t This paper addresses the se urity of authenti ated en ryption s hemes in the… Expand
Highly Cited
2000
Highly Cited
2000
A b s t r a c t We consider the problem of nearest neighbor search in the Euclidean hypercube [ -1 ,+1 ] d with uniform… Expand
  • table 1
  • figure 1
  • figure 2
  • figure 3