Results 11 - 20 of 22,195

Laplacian eigenmaps and spectral techniques for embedding and clustering.

by Mikhail Belkin , Partha Niyogi - Proceeding of Neural Information Processing Systems, , 2001
"... Abstract Drawing on the correspondence between the graph Laplacian, the Laplace-Beltrami op erator on a manifold , and the connections to the heat equation , we propose a geometrically motivated algorithm for constructing a representation for data sampled from a low dimensional manifold embedded in ..."
Abstract - Cited by 668 (7 self) - Add to MetaCart
of the manifold on which the data may possibly reside. Recently, there has been some interest (Tenenbaum et aI, 2000 ; The core algorithm is very simple, has a few local computations and one sparse eigenvalu e problem. The solution reflects th e intrinsic geom etric structure of the manifold. Th e justification

Concurrent Constraint Programming

by Vijay A. Saraswat, Martin Rinard , 1993
"... This paper presents a new and very rich class of (con-current) programming languages, based on the notion of comput.ing with parhal information, and the con-commitant notions of consistency and entailment. ’ In this framework, computation emerges from the inter-action of concurrently executing agent ..."
Abstract - Cited by 502 (16 self) - Add to MetaCart
-text of concurrency because of the use of constraints for communication and control, and in the context of AI because of the availability of simple yet powerful mechanisms for controlling inference, and the promise that very rich representational/programming languages, sharing the same set of abstract properties, may

Towards flexible teamwork

by Milind Tambe - JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH , 1997
"... Many AI researchers are today striving to build agent teams for complex, dynamic multi-agent domains, with intended applications in arenas such as education, training, entertainment, information integration, and collective robotics. Unfortunately, uncertainties in these complex, dynamic domains obst ..."
Abstract - Cited by 570 (59 self) - Add to MetaCart
Many AI researchers are today striving to build agent teams for complex, dynamic multi-agent domains, with intended applications in arenas such as education, training, entertainment, information integration, and collective robotics. Unfortunately, uncertainties in these complex, dynamic domains

Knowledge Discovery in Databases: an Overview

by William J. Frawley, Gregory Piatetsky-shapiro, Christopher J. Matheus , 1992
"... this article. 0738-4602/92/$4.00 1992 AAAI 58 AI MAGAZINE for the 1990s (Silberschatz, Stonebraker, and Ullman 1990) ..."
Abstract - Cited by 473 (3 self) - Add to MetaCart
this article. 0738-4602/92/$4.00 1992 AAAI 58 AI MAGAZINE for the 1990s (Silberschatz, Stonebraker, and Ullman 1990)

From Data Mining to Knowledge Discovery in Databases.

by Usama Fayyad , Gregory Piatetsky-Shapiro , Padhraic Smyth - AI Magazine, , 1996
"... ■ Data mining and knowledge discovery in databases have been attracting a significant amount of research, industry, and media attention of late. What is all the excitement about? This article provides an overview of this emerging field, clarifying how data mining and knowledge discovery in database ..."
Abstract - Cited by 538 (0 self) - Add to MetaCart
is discussed in more detail in the context of specific data-mining algorithms and their application. Real-world practical application issues are also outlined. Finally, the article enumerates challenges for future research and development and in particular discusses potential opportunities for AI technology

Algorithms for Constraint-Satisfaction Problems: A Survey

by Vipin Kumar , 1992
"... A large number of problems in AI and other areas of computer science can be viewed as special cases of the constraint-satisfaction problem. Some examples are machine vision, belief maintenance, scheduling, temporal reasoning, graph problems, floor plan design, the planning of genetic experiments, an ..."
Abstract - Cited by 449 (0 self) - Add to MetaCart
A large number of problems in AI and other areas of computer science can be viewed as special cases of the constraint-satisfaction problem. Some examples are machine vision, belief maintenance, scheduling, temporal reasoning, graph problems, floor plan design, the planning of genetic experiments

Level-Spacing Distributions and the Airy Kernel

by Craig A. Tracy, Harold Widom - COMMUNICATIONS IN MATHEMATICAL PHYSICS , 1994
"... Scaling level-spacing distribution functions in the "bulk of the spectrum" in random matrix models of N x N hermitian matrices and then going to the limit N — » oo leads to the Fredholm determinant of the sine kernel sinπ(x — y)/π(x — y). Similarly a scaling limit at the "edge o ..."
Abstract - Cited by 430 (24 self) - Add to MetaCart
;quot;edge of the spectrum " leads to the Airy kernel [Ai(x) Ai(y) — Ai (x) Ai(y)]/(x — y). In this paper we derive analogues for this Airy kernel of the following properties of the sine kernel: the completely integrable system of P.D.E.'s found by Jimbo, Miwa, Mori, and Sato; the expression, in the case of a

Notes On Formalizing Context

by John McCarthy , 1993
"... These notes discuss formalizing contexts as first class objects. The basic relation is ist(c; p). It asserts that the proposition p is true in the context c. The most important formulas relate the propositions true in different contexts. Introducing contexts as formal objects will permit axiomatizat ..."
Abstract - Cited by 417 (9 self) - Add to MetaCart
axiomatizations in limited contexts to be expanded to transcend the original limitations. This seems necessary to provide AI programs using logic with certain capabilities that human fact representation and human reasoning possess. Fully implementing transcendence seems to require further extensions

CAPTCHA: Using Hard AI Problems for Security

by Luis von Ahn, Manuel Blum, Nicholas J. Hopper, John Langford - IN PROCEEDINGS OF EUROCRYPT , 2003
"... We introduce captcha, an automated test that humans can pass, but current computer programs can't pass: any program that has high success over a captcha can be used to solve an unsolved Artificial Intelligence (AI) problem. We provide several novel constructions of captchas. Since captchas ..."
Abstract - Cited by 331 (4 self) - Add to MetaCart
We introduce captcha, an automated test that humans can pass, but current computer programs can't pass: any program that has high success over a captcha can be used to solve an unsolved Artificial Intelligence (AI) problem. We provide several novel constructions of captchas. Since captchas

Multiagent Systems: A Survey from a Machine Learning Perspective

by Peter Stone, Manuela Veloso - AUTONOMOUS ROBOTS , 1997
"... Distributed Artificial Intelligence (DAI) has existed as a subfield of AI for less than two decades. DAI is ..."
Abstract - Cited by 372 (24 self) - Add to MetaCart
Distributed Artificial Intelligence (DAI) has existed as a subfield of AI for less than two decades. DAI is
Results 11 - 20 of 22,195