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

AND ARITHMETIC PROGRAMS PRODUCED SIGNIFICANT GAINS IN

by By- Matthewse, Charles V. Roam, John E, Student Development, Problem Children, School Holding, Most Dropoutprone, On The, Bases Of Intelligence , 1966
"... osnasomr-legMakIMEti' ..."
Abstract - Add to MetaCart
osnasomr-legMakIMEti'

Cumulated Gain-based Evaluation of IR Techniques

by Kalervo Järvelin, Jaana Kekäläinen - ACM Transactions on Information Systems , 2002
"... Modem large retrieval environments tend to overwhelm their users by their large output. Since all documents are not of equal relevance to their users, highly relevant documents should be identified and ranked first for presentation to the users. In order to develop IR techniques to this direction, i ..."
Abstract - Cited by 694 (3 self) - Add to MetaCart
. Alternatively, novel measures based on graded relevance assessments may be developed. This paper proposes three novel measures that compute the cumulative gain the user obtains by examining the retrieval result up to a given ranked position. The first one accumulates the relevance scores of retrieved documents

A Pairwise Key Pre-Distribution Scheme for Wireless Sensor Networks

by Wenliang Du, Jing Deng, Yunghsiang S. Han, Pramod K. Varshney, Jonathan Katz, Aram Khalili , 2003
"... this paper, we provide a framework in which to study the security of key pre-distribution schemes, propose a new key pre-distribution scheme which substantially improves the resilience of the network compared to previous schemes, and give an in-depth analysis of our scheme in terms of network resili ..."
Abstract - Cited by 552 (18 self) - Add to MetaCart
-scale network breaches to an adversary, and makes it necessary for the adversary to attack a large fraction of the network before it can achieve any significant gain

Max-margin Markov networks

by Ben Taskar, Carlos Guestrin, Daphne Koller , 2003
"... In typical classification tasks, we seek a function which assigns a label to a single object. Kernel-based approaches, such as support vector machines (SVMs), which maximize the margin of confidence of the classifier, are the method of choice for many such tasks. Their popularity stems both from the ..."
Abstract - Cited by 604 (15 self) - Add to MetaCart
for learning M 3 networks based on a compact quadratic program formulation. We provide a new theoretical bound for generalization in structured domains. Experiments on the task of handwritten character recognition and collective hypertext classification demonstrate very significant gains over previous

An Approximation to Compartmental Neuronal Modelling with Significant Gains in Performance

by Christopher J. Coomber
"... In this paper I present the results of an investigation into modelling neurons by a method that approximates the realistic dynamics achieved by compartmental modelling but with significantly less computation. The method employs artificial neural networks as the components for modelling voltage- and ..."
Abstract - Add to MetaCart
In this paper I present the results of an investigation into modelling neurons by a method that approximates the realistic dynamics achieved by compartmental modelling but with significantly less computation. The method employs artificial neural networks as the components for modelling voltage

Bagging predictors

by LEO BREIMAN , 1996
"... Bagging predictors is a method for generating multiple versions of a predictor and using these to get an aggregated predictor. The aggregation averages over the versions when predicting a numerical outcome and does a plurality vote when predicting a class. The multiple versions are formed by making ..."
Abstract - Cited by 3650 (1 self) - Add to MetaCart
by making bootstrap replicates of the learning set and using these as new learning sets. Tests on real and simulated data sets using classification and regression trees and subset selection in linear regression show that bagging can give substantial gains in accuracy. The vital element is the instability

Chaff: Engineering an Efficient SAT Solver

by Matthew W. Moskewicz , Conor F. Madigan, Ying Zhao, Lintao Zhang, Sharad Malik , 2001
"... Boolean Satisfiability is probably the most studied of combinatorial optimization/search problems. Significant effort has been devoted to trying to provide practical solutions to this problem for problem instances encountered in a range of applications in Electronic Design Automation (EDA), as well ..."
Abstract - Cited by 1350 (18 self) - Add to MetaCart
. In this paper we describe the development of a new complete solver, Chaff, which achieves significant performance gains through careful engineering of all aspects of the search – especially a particularly efficient implementation of Boolean constraint propagation (BCP) and a novel low overhead decision strategy

Evolving Neural Networks through Augmenting Topologies

by Kenneth O. Stanley, Risto Miikkulainen - Evolutionary Computation
"... An important question in neuroevolution is how to gain an advantage from evolving neural network topologies along with weights. We present a method, NeuroEvolution of Augmenting Topologies (NEAT), which outperforms the best fixed-topology method on a challenging benchmark reinforcement learning task ..."
Abstract - Cited by 536 (112 self) - Add to MetaCart
An important question in neuroevolution is how to gain an advantage from evolving neural network topologies along with weights. We present a method, NeuroEvolution of Augmenting Topologies (NEAT), which outperforms the best fixed-topology method on a challenging benchmark reinforcement learning

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
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

Job Creation and Destruction

by J. C. Haltiwanger, S. Schuh , 1996
"... With unemployment at historically high levels in many OECD countries, increased job creation has risen to the top of the policy agenda for many western governments-but how can this be achieved? The importance of job creation (and destruction) in an economy cannot be overstated. Labour is organized a ..."
Abstract - Cited by 909 (68 self) - Add to MetaCart
and generalists, and significantly advances our understanding of the dynamics of job gain and loss. Simple and very useful examples are often presented to clarify measurement concepts, thus increasing the accessibility of the results and the
Next 10 →
Results 1 - 10 of 24,975
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