• 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 3,478
Next 10 →

Distortion invariant object recognition in the dynamic link architecture

by Martin Lades, Jan C. Vorbrüggen, Joachim Buhmann, Christoph v. d. Malsburg, Rolf P. Würtz, Wolfgang Konen - IEEE TRANSACTIONS ON COMPUTERS , 1993
"... We present an object recognition system based on the Dynamic Link Architecture, which is an extension to classical Artificial Neural Networks. The Dynamic Link Architecture ex-ploits correlations in the fine-scale temporal structure of cellular signals in order to group neurons dynamically into hig ..."
Abstract - Cited by 637 (80 self) - Add to MetaCart
matching cost function. Our implementation on a transputer network successfully achieves recognition of human faces and office objects from gray level camera images. The performance of the program is evaluated by a statistical analysis of recognition results from a portrait gallery comprising images of 87

Monopolistic competition and optimum product diversity. The American Economic Review,

by Avinash K Dixit , Joseph E Stiglitz , Harold Hotelling , Nicholas Stern , Kelvin Lancaster , Stiglitz , 1977
"... The basic issue concerning production in welfare economics is whether a market solution will yield the socially optimum kinds and quantities of commodities. It is well known that problems can arise for three broad reasons: distributive justice; external effects; and scale economies. This paper is c ..."
Abstract - Cited by 1911 (5 self) - Add to MetaCart
is concerned with the last of these. The basic principle is easily stated.' A commodity should be produced if the costs can be covered by the sum of revenues and a properly defined measure of consumer's surplus. The optimum amount is then found by equating the demand price and the marginal cost

Optimizing Search Engines using Clickthrough Data

by Thorsten Joachims , 2002
"... This paper presents an approach to automatically optimizing the retrieval quality of search engines using clickthrough data. Intuitively, a good information retrieval system should present relevant documents high in the ranking, with less relevant documents following below. While previous approaches ..."
Abstract - Cited by 1314 (23 self) - Add to MetaCart
-log of the search engine in connection with the log of links the users clicked on in the presented ranking. Such clickthrough data is available in abundance and can be recorded at very low cost. Taking a Support Vector Machine (SVM) approach, this paper presents a method for learning retrieval functions. From a

Benchmarking Least Squares Support Vector Machine Classifiers

by Tony Van Gestel, Johan A. K. Suykens, Bart Baesens, Stijn Viaene, Jan Vanthienen, Guido Dedene, Bart De Moor, Joos Vandewalle - NEURAL PROCESSING LETTERS , 2001
"... In Support Vector Machines (SVMs), the solution of the classification problem is characterized by a (convex) quadratic programming (QP) problem. In a modified version of SVMs, called Least Squares SVM classifiers (LS-SVMs), a least squares cost function is proposed so as to obtain a linear set of eq ..."
Abstract - Cited by 476 (46 self) - Add to MetaCart
In Support Vector Machines (SVMs), the solution of the classification problem is characterized by a (convex) quadratic programming (QP) problem. In a modified version of SVMs, called Least Squares SVM classifiers (LS-SVMs), a least squares cost function is proposed so as to obtain a linear set

Efficiency Loss in a Network Resource Allocation Game: The Case of Elastic Supply

by Ramesh Johari, Shie Mannor, John N. Tsitsiklis , 2008
"... We consider a resource allocation problem where individual users wish to send data across a network to maximize their utility, and a cost is incurred at each link that depends on the total rate sent through the link. It is known that as long as users do not anticipate the effect of their actions on ..."
Abstract - Cited by 211 (12 self) - Add to MetaCart
of their actions on link prices. Under the assumption that the links’ marginal cost functions are convex, we establish existence of a Nash equilibrium. We show that the aggregate surplus at a Nash equilibrium is no worse than a factor of 4 √ 2 − 5 times the optimal aggregate surplus; thus, the efficiency loss when

Sharing the Cost of Multicast Transmissions

by Joan Feigenbaum, Christos H. Papadimitriou, Scott Shenker , 2001
"... We investigate cost-sharing algorithms for multicast transmission. Economic considerations point to two distinct mechanisms, marginal cost and Shapley value, as the two solutions most appropriate in this context. We prove that the former has a natural algorithm that uses only two messages per link o ..."
Abstract - Cited by 284 (16 self) - Add to MetaCart
We investigate cost-sharing algorithms for multicast transmission. Economic considerations point to two distinct mechanisms, marginal cost and Shapley value, as the two solutions most appropriate in this context. We prove that the former has a natural algorithm that uses only two messages per link

Maximum Lifetime Routing In Wireless Sensor Networks

by Jae-hwan Chang, Leandros Tassiulas - IEEE/ACM TRANSACTIONS ON NETWORKING , 2000
"... Routing in power-controlled wireless sensor networks is formulated as an optimization problem with the goal of maximizing the system lifetime. Considering that the information is delivered in the form of packets, we identified the problem as an integer programming problem. It is known that the syste ..."
Abstract - Cited by 282 (0 self) - Add to MetaCart
and examined in order to find the best link cost function and the method of shortest path calculation. The performance comparison is made through simulation in a typical battlefield scenario where sensors detecting a moving target vehicle periodically send a reporting packet to one of the gateway nodes

Maximum margin planning

by Nathan D. Ratliff, J. Andrew Bagnell, Martin A. Zinkevich - IN PROCEEDINGS OF THE 23RD INTERNATIONAL CONFERENCE ON MACHINE LEARNING (ICML’06 , 2006
"... Imitation learning of sequential, goaldirected behavior by standard supervised techniques is often difficult. We frame learning such behaviors as a maximum margin structured prediction problem over a space of policies. In this approach, we learn mappings from features to cost so an optimal policy in ..."
Abstract - Cited by 145 (28 self) - Add to MetaCart
Imitation learning of sequential, goaldirected behavior by standard supervised techniques is often difficult. We frame learning such behaviors as a maximum margin structured prediction problem over a space of policies. In this approach, we learn mappings from features to cost so an optimal policy

Effective Capacity: A Wireless Link Model for Support of Quality of Service

by Dapeng Wu, Rohit Negi
"... To facilitate the efficient support of quality of service (QoS) in next-generation wireless networks, it is essential to model a wireless channel in terms of connection-level QoS metrics such as data rate, delay and delay-violation probability. However, the existing wireless channel models, i.e., ph ..."
Abstract - Cited by 197 (17 self) - Add to MetaCart
-empty buer, and the QoS exponent of a connection. Then, we propose a simple and efficient algorithm to estimate these EC functions. The physical-layer analogs of these two link-layer EC functions are the marginal distribution (e.g., Rayleigh/Ricean distribution) and the Doppler spectrum, respectively

Understanding relationships using copulas

by Emiliano A. Valdez - North American Actuarial Journal , 1998
"... This article introduces actuaries to the concept of "copulas, " a tool for understanding relationships among multivariate outcomes. A copula is a function that links univariate marginals to their full multivariate distribution. Copulas were introduced in 1959 in the context of prob ..."
Abstract - Cited by 224 (8 self) - Add to MetaCart
This article introduces actuaries to the concept of "copulas, " a tool for understanding relationships among multivariate outcomes. A copula is a function that links univariate marginals to their full multivariate distribution. Copulas were introduced in 1959 in the context
Next 10 →
Results 1 - 10 of 3,478
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