• 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 11 - 20 of 76
Next 10 →

Data-Intensive Biocomputing in the Cloud

by Nabeel Meeramohideen Mohamed, Ali Raza, Ashraf Butt, Nabeel Meeramohideen Mohamed , 2013
"... Next-generation sequencing (NGS) technologies have made it possible to rapidly sequence the human genome, heralding a new era of health-care innovations based on personalized genetic information. However, these NGS technologies generate data at a rate that far outstrips Moore’s Law. As a consequence ..."
Abstract - Add to MetaCart
Next-generation sequencing (NGS) technologies have made it possible to rapidly sequence the human genome, heralding a new era of health-care innovations based on personalized genetic information. However, these NGS technologies generate data at a rate that far outstrips Moore’s Law. As a

The Datacenter as a Computer An Introduction to the Design of Warehouse-Scale Machinesiii Synthesis Lectures on Computer Architecture Editor

by unknown authors
"... ..."
Abstract - Add to MetaCart
Abstract not found

The Datacenter as a Computer An Introduction to the Design of Warehouse-Scale Machinesiii Synthesis Lectures on Computer Architecture Editor

by unknown authors
"... ..."
Abstract - Add to MetaCart
Abstract not found

The Datacenter as a Computer An Introduction to the Design of Warehouse-Scale Machinesiii Synthesis Lectures on Computer Architecture Editor

by unknown authors
"... ..."
Abstract - Add to MetaCart
Abstract not found

Chapter 12 Rough Sets and Rough Logic: A KDD Perspective

by Zdzis Law Pawlak, Lech Polkowski, Andrzej Skowron
"... Abstract Basic ideas of rough set theory were proposed by Zdzis law Pawlak [85, 86] in the early 1980’s. In the ensuing years, we have witnessed a systematic, world–wide growth of interest in rough sets and their applications. The main goal of rough set analysis is induction of approximations of con ..."
Abstract - Add to MetaCart
Abstract Basic ideas of rough set theory were proposed by Zdzis law Pawlak [85, 86] in the early 1980’s. In the ensuing years, we have witnessed a systematic, world–wide growth of interest in rough sets and their applications. The main goal of rough set analysis is induction of approximations

unknown title

by unknown authors
"... It is interesting to note that as practical limita-tions were removed, several fundamental or principal limitations were established. For instance, Carnot showed that there was a fun-damental limit to how much energy could be extracted from a heat engine. Later this result was generalized to the sec ..."
Abstract - Add to MetaCart
It is interesting to note that as practical limita-tions were removed, several fundamental or principal limitations were established. For instance, Carnot showed that there was a fun-damental limit to how much energy could be extracted from a heat engine. Later this result was generalized

ACKNOWLEDGMENTS

by Shahar Kosti, This Prof, Gal A. Kaminka, David Sarne
"... First, I would like to thank my advisors Prof. Gal A. Kaminka and Dr. David Sarne for their excellent guidance and constant support in the past two years. I learned quite a bit about scientific research, all thanks to their great instruction. Working with them was a real pleasure, not only on the pr ..."
Abstract - Add to MetaCart
First, I would like to thank my advisors Prof. Gal A. Kaminka and Dr. David Sarne for their excellent guidance and constant support in the past two years. I learned quite a bit about scientific research, all thanks to their great instruction. Working with them was a real pleasure, not only

1A WEIGHTED-TREE SIMILARITY ALGORITHM FOR MULTI-AGENT SYSTEMS IN E-BUSINESS ENVIRONMENTS*

by Virendrakumar C. Bhavsar, Harold Boley, Lu Yang
"... A tree similarity algorithm for match-making of agents in e-Business environments is presented. Product/service descriptions of seller and buyer agents are represented as node-labelled, arc-labelled, arc-weighted trees. A similarity algorithm for such trees is developed as the basis for semantic mat ..."
Abstract - Add to MetaCart
A tree similarity algorithm for match-making of agents in e-Business environments is presented. Product/service descriptions of seller and buyer agents are represented as node-labelled, arc-labelled, arc-weighted trees. A similarity algorithm for such trees is developed as the basis for semantic

Tabu search based algorithms for DNA sequencing

by Jacek Blazewicz, Marta Kasprzak, Aleksandra Swiercz
"... 1 DNA sequencing problem The DNA sequencing is an elementary approach in computational molecular biology, leading to recognizing genetic information of organisms. The information is encoded as a sequence of nucleotides (basic particles of DNA) composing double helix, which in human beings reaches th ..."
Abstract - Add to MetaCart
1 DNA sequencing problem The DNA sequencing is an elementary approach in computational molecular biology, leading to recognizing genetic information of organisms. The information is encoded as a sequence of nucleotides (basic particles of DNA) composing double helix, which in human beings reaches

unknown title

by Pasquale De Meo A, Giovanni Quattrone A, Giorgio Terracina B, Domenico Ursino A
"... IOS Press Utilization of intelligent agents for supporting citizens in their access to e-government services 1 ..."
Abstract - Add to MetaCart
IOS Press Utilization of intelligent agents for supporting citizens in their access to e-government services 1
Next 10 →
Results 11 - 20 of 76
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