• 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 65,429
Next 10 →

1. MAIN PROBLEMS OF CHINESE

by unknown authors
"... www.cscanada.net www.cscanada.org ..."
Abstract - Add to MetaCart
www.cscanada.net www.cscanada.org

LEGISLATION AS THE MAIN PROBLEM

by Mohammad Reza, Zali Md Facg, Saeed Shahraz Md, Shokoufeh Borzabadi Msc
"... ch ive of ..."
Abstract - Add to MetaCart
Abstract not found

A Conceptual Framework and a Toolkit for Supporting the Rapid Prototyping of Context-Aware Applications

by Anind K. Dey, Gregory D. Abowd, Daniel Salber , 2001
"... Computing devices and applications are now used beyond the desktop, in diverse environments, and this trend toward ubiquitous computing is accelerating. One challenge that remains in this emerging research field is the ability to enhance the behavior of any application by informing it of the context ..."
Abstract - Cited by 906 (28 self) - Add to MetaCart
removed from that vision. This is due to three main problems: (1) the notion of context is still ill defined; (2) there is a lack of conceptual models and methods to help drive the design of context-aware applications; and (3) no tools are available to jump-start the development of context

Income Tax Evasion: A Theoretical Analysis

by Michael G. Allingham, Agnar Sandmo - Journal of Public Economics , 1972
"... Theoretical analysis of the connection between taxation and risk-taking has mainly been concerned with the effect of taxes on portfolio decisions of consumers, Mossin (1968b) and Stiglitz (1969). However, there are some problems which are not naturally classified under this ..."
Abstract - Cited by 568 (0 self) - Add to MetaCart
Theoretical analysis of the connection between taxation and risk-taking has mainly been concerned with the effect of taxes on portfolio decisions of consumers, Mossin (1968b) and Stiglitz (1969). However, there are some problems which are not naturally classified under this

THE MAIN PROBLEM IN SATELLITE THEORY REVISITED

by Liam M. Healy , 2000
"... Using the elimination of the parallax followed by the Delaunay normalization, we present a procedure for calculating a normal form of the main problem (J2 perturbation only) in satellite theory. This procedure is outlined in such a way that an object-oriented automatic symbolic manipulator based on ..."
Abstract - Add to MetaCart
Using the elimination of the parallax followed by the Delaunay normalization, we present a procedure for calculating a normal form of the main problem (J2 perturbation only) in satellite theory. This procedure is outlined in such a way that an object-oriented automatic symbolic manipulator based

Algorithmic mechanism design

by Noam Nisan, Amir Ronen - Games and Economic Behavior , 1999
"... We consider algorithmic problems in a distributed setting where the participants cannot be assumed to follow the algorithm but rather their own self-interest. As such participants, termed agents, are capable of manipulating the algorithm, the algorithm designer should ensure in advance that the agen ..."
Abstract - Cited by 662 (23 self) - Add to MetaCart
that the agents ’ interests are best served by behaving correctly. Following notions from the field of mechanism design, we suggest a framework for studying such algorithms. Our main technical contribution concerns the study of a representative task scheduling problem for which the standard mechanism design tools

A Singular Value Thresholding Algorithm for Matrix Completion

by Jian-Feng Cai, Emmanuel J. Candès, Zuowei Shen , 2008
"... This paper introduces a novel algorithm to approximate the matrix with minimum nuclear norm among all matrices obeying a set of convex constraints. This problem may be understood as the convex relaxation of a rank minimization problem, and arises in many important applications as in the task of reco ..."
Abstract - Cited by 555 (22 self) - Add to MetaCart
-to-implement algorithm that is extremely efficient at addressing problems in which the optimal solution has low rank. The algorithm is iterative and produces a sequence of matrices {X k, Y k} and at each step, mainly performs a soft-thresholding operation on the singular values of the matrix Y k. There are two

Abduction in Logic Programming

by Marc Denecker, Antonis Kakas
"... Abduction in Logic Programming started in the late 80s, early 90s, in an attempt to extend logic programming into a framework suitable for a variety of problems in Artificial Intelligence and other areas of Computer Science. This paper aims to chart out the main developments of the field over th ..."
Abstract - Cited by 624 (77 self) - Add to MetaCart
Abduction in Logic Programming started in the late 80s, early 90s, in an attempt to extend logic programming into a framework suitable for a variety of problems in Artificial Intelligence and other areas of Computer Science. This paper aims to chart out the main developments of the field over

Training Support Vector Machines: an Application to Face Detection

by Edgar Osuna, Robert Freund, Federico Girosi , 1997
"... We investigate the application of Support Vector Machines (SVMs) in computer vision. SVM is a learning technique developed by V. Vapnik and his team (AT&T Bell Labs.) that can be seen as a new method for training polynomial, neural network, or Radial Basis Functions classifiers. The decision sur ..."
Abstract - Cited by 727 (1 self) - Add to MetaCart
global optimality, and can be used to train SVM's over very large data sets. The main idea behind the decomposition is the iterative solution of sub-problems and the evaluation of optimality conditions which are used both to generate improved iterative values, and also establish the stopping

Large margin methods for structured and interdependent output variables

by Ioannis Tsochantaridis, Thorsten Joachims, Thomas Hofmann, Yasemin Altun - JOURNAL OF MACHINE LEARNING RESEARCH , 2005
"... Learning general functional dependencies between arbitrary input and output spaces is one of the key challenges in computational intelligence. While recent progress in machine learning has mainly focused on designing flexible and powerful input representations, this paper addresses the complementary ..."
Abstract - Cited by 624 (12 self) - Add to MetaCart
Learning general functional dependencies between arbitrary input and output spaces is one of the key challenges in computational intelligence. While recent progress in machine learning has mainly focused on designing flexible and powerful input representations, this paper addresses
Next 10 →
Results 1 - 10 of 65,429
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