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

Learning to rank using gradient descent

by Chris Burges, Tal Shaked, Erin Renshaw, Matt Deeds, Nicole Hamilton, Greg Hullender - In ICML , 2005
"... We investigate using gradient descent methods for learning ranking functions; we propose a simple probabilistic cost function, and we introduce RankNet, an implementation of these ideas using a neural network to model the underlying ranking function. We present test results on toy data and on data f ..."
Abstract - Cited by 534 (17 self) - Add to MetaCart
We investigate using gradient descent methods for learning ranking functions; we propose a simple probabilistic cost function, and we introduce RankNet, an implementation of these ideas using a neural network to model the underlying ranking function. We present test results on toy data and on data

Querying Heterogeneous Information Sources Using Source Descriptions

by Alon Levy, Anand Rajaraman, Joann Ordille , 1996
"... We witness a rapid increase in the number of structured information sources that are available online, especially on the WWW. These sources include commercial databases on product information, stock market information, real estate, automobiles, and entertainment. We would like to use the data stored ..."
Abstract - Cited by 724 (34 self) - Add to MetaCart
We witness a rapid increase in the number of structured information sources that are available online, especially on the WWW. These sources include commercial databases on product information, stock market information, real estate, automobiles, and entertainment. We would like to use the data

Finding community structure in networks using the eigenvectors of matrices

by M. E. J. Newman , 2006
"... We consider the problem of detecting communities or modules in networks, groups of vertices with a higher-than-average density of edges connecting them. Previous work indicates that a robust approach to this problem is the maximization of the benefit function known as “modularity ” over possible div ..."
Abstract - Cited by 502 (0 self) - Add to MetaCart
We consider the problem of detecting communities or modules in networks, groups of vertices with a higher-than-average density of edges connecting them. Previous work indicates that a robust approach to this problem is the maximization of the benefit function known as “modularity ” over possible

Specificity and mechanism of action of some commonly used protein kinase inhibitors

by Stephen P. Davies, Helen Reddy, Matilde Caivano, Philip Cohen - Biochem. J , 2000
"... The specificities of 28 commercially available compounds reported to be relatively selective inhibitors of particular serine� threonine-specific protein kinases have been examined against a large panel of protein kinases. The compounds KT 5720, Rottlerin and quercetin were found to inhibit many prot ..."
Abstract - Cited by 532 (1 self) - Add to MetaCart
The specificities of 28 commercially available compounds reported to be relatively selective inhibitors of particular serine� threonine-specific protein kinases have been examined against a large panel of protein kinases. The compounds KT 5720, Rottlerin and quercetin were found to inhibit many

Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming

by M. X. Goemans, D.P. Williamson - Journal of the ACM , 1995
"... We present randomized approximation algorithms for the maximum cut (MAX CUT) and maximum 2-satisfiability (MAX 2SAT) problems that always deliver solutions of expected value at least .87856 times the optimal value. These algorithms use a simple and elegant technique that randomly rounds the solution ..."
Abstract - Cited by 1211 (13 self) - Add to MetaCart
We present randomized approximation algorithms for the maximum cut (MAX CUT) and maximum 2-satisfiability (MAX 2SAT) problems that always deliver solutions of expected value at least .87856 times the optimal value. These algorithms use a simple and elegant technique that randomly rounds

Comparison of discrimination methods for the classification of tumors using gene expression data

by Sandrine Dudoit, Jane Fridlyand, Terence P. Speed - JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION , 2002
"... A reliable and precise classification of tumors is essential for successful diagnosis and treatment of cancer. cDNA microarrays and high-density oligonucleotide chips are novel biotechnologies increasingly used in cancer research. By allowing the monitoring of expression levels in cells for thousand ..."
Abstract - Cited by 770 (6 self) - Add to MetaCart
for thousands of genes simultaneously, microarray experiments may lead to a more complete understanding of the molecular variations among tumors and hence to a finer and more informative classification. The ability to successfully distinguish between tumor classes (already known or yet to be discovered) using

Breaking and Fixing the Needham-Schroeder Public-Key Protocol using FDR

by Gavin Lowe , 1996
"... In this paper we analyse the well known Needham-Schroeder Public-Key Protocol using FDR, a refinement checker for CSP. We use FDR to discover an attack upon the protocol, which allows an intruder to impersonate another agent. We adapt the protocol, and then use FDR to show that the new protocol is s ..."
Abstract - Cited by 719 (13 self) - Add to MetaCart
In this paper we analyse the well known Needham-Schroeder Public-Key Protocol using FDR, a refinement checker for CSP. We use FDR to discover an attack upon the protocol, which allows an intruder to impersonate another agent. We adapt the protocol, and then use FDR to show that the new protocol

Using spin images for efficient object recognition in cluttered 3D scenes

by Andrew E. Johnson, Martial Hebert - IEEE Transactions on Pattern Analysis and Machine Intelligence , 1999
"... We present a 3-D shape-based object recognition system for simultaneous recognition of multiple objects in scenes containing clutter and occlusion. Recognition is based on matching surfaces by matching points using the spin-image representation. The spin-image is a data level shape descriptor that i ..."
Abstract - Cited by 582 (9 self) - Add to MetaCart
We present a 3-D shape-based object recognition system for simultaneous recognition of multiple objects in scenes containing clutter and occlusion. Recognition is based on matching surfaces by matching points using the spin-image representation. The spin-image is a data level shape descriptor

Isolation of a cDNA clone derived from a blood-borne non-A, non-B viral hepatitis genome

by Author(s) Qui-lim Choo, George Kuo, Amy J. Weiner, Lacy R. Overby, Daniel W. Bradley, Michael Houghton , 1989
"... you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your personal, non-commercial use. Please contact the publisher regarding any further use of this work. Publisher contact inform ..."
Abstract - Cited by 649 (14 self) - Add to MetaCart
you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your personal, non-commercial use. Please contact the publisher regarding any further use of this work. Publisher contact

Does trade cause growth

by A. Frankel, David Romer - American Economic Review , 1999
"... you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your personal, non-commercial use. Please contact the publisher regarding any further use of this work. Publisher contact inform ..."
Abstract - Cited by 1048 (14 self) - Add to MetaCart
you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your personal, non-commercial use. Please contact the publisher regarding any further use of this work. Publisher contact
Next 10 →
Results 1 - 10 of 266,741
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