Results 1  10
of
457,371
Knowledge acquisition via incremental conceptual clustering
 Machine Learning
, 1987
"... hill climbing Abstract. Conceptual clustering is an important way of summarizing and explaining data. However, the recent formulation of this paradigm has allowed little exploration of conceptual clustering as a means of improving performance. Furthermore, previous work in conceptual clustering has ..."
Abstract

Cited by 756 (8 self)
 Add to MetaCart
hill climbing Abstract. Conceptual clustering is an important way of summarizing and explaining data. However, the recent formulation of this paradigm has allowed little exploration of conceptual clustering as a means of improving performance. Furthermore, previous work in conceptual clustering has
The Structuring of Organizations
, 1979
"... r..... ".".• Tk. · i t/ iJ ~.'v"'~~. n.~~ f ~)/td { " / '177 Contents i ..."
Abstract

Cited by 646 (0 self)
 Add to MetaCart
r..... ".".• Tk. · i t/ iJ ~.'v"'~~. n.~~ f ~)/td { " / '177 Contents i
Modular elliptic curves and Fermat’s Last Theorem
 ANNALS OF MATH
, 1995
"... When Andrew John Wiles was 10 years old, he read Eric Temple Bell’s The Last Problem and was so impressed by it that he decided that he would be the first person to prove Fermat’s Last Theorem. This theorem states that there are no nonzero integers a, b, c, n with n> 2 such that a n + b n = c n ..."
Abstract

Cited by 622 (1 self)
 Add to MetaCart
When Andrew John Wiles was 10 years old, he read Eric Temple Bell’s The Last Problem and was so impressed by it that he decided that he would be the first person to prove Fermat’s Last Theorem. This theorem states that there are no nonzero integers a, b, c, n with n> 2 such that a n + b n = c
An Optimal Algorithm for Approximate Nearest Neighbor Searching in Fixed Dimensions
 ACMSIAM SYMPOSIUM ON DISCRETE ALGORITHMS
, 1994
"... Consider a set S of n data points in real ddimensional space, R d , where distances are measured using any Minkowski metric. In nearest neighbor searching we preprocess S into a data structure, so that given any query point q 2 R d , the closest point of S to q can be reported quickly. Given any po ..."
Abstract

Cited by 987 (32 self)
 Add to MetaCart
Consider a set S of n data points in real ddimensional space, R d , where distances are measured using any Minkowski metric. In nearest neighbor searching we preprocess S into a data structure, so that given any query point q 2 R d , the closest point of S to q can be reported quickly. Given any
The Visual Analysis of Human Movement: A Survey
 Computer Vision and Image Understanding
, 1999
"... The ability to recognize humans and their activities by vision is key for a machine to interact intelligently and effortlessly with a humaninhabited environment. Because of many potentially important applications, “looking at people ” is currently one of the most active application domains in compu ..."
Abstract

Cited by 731 (8 self)
 Add to MetaCart
methodologies; they are grouped in 2D approaches with or without explicit shape models and 3D approaches. Where appropriate, systems are reviewed. We conclude with some thoughts about future directions. c ○ 1999 Academic Press 1.
ATTENTION, INTENTIONS, AND THE STRUCTURE OF DISCOURSE
, 1986
"... In this paper we explore a new theory of discourse structure that stresses the role of purpose and processing in discourse. In this theory, discourse structure is composed of three separate but interrelated components: the structure of the sequence of utterances (called the linguistic structure), a ..."
Abstract

Cited by 1257 (49 self)
 Add to MetaCart
In this paper we explore a new theory of discourse structure that stresses the role of purpose and processing in discourse. In this theory, discourse structure is composed of three separate but interrelated components: the structure of the sequence of utterances (called the linguistic structure
The structure and function of complex networks
 SIAM REVIEW
, 2003
"... Inspired by empirical studies of networked systems such as the Internet, social networks, and biological networks, researchers have in recent years developed a variety of techniques and models to help us understand or predict the behavior of these systems. Here we review developments in this field, ..."
Abstract

Cited by 2591 (7 self)
 Add to MetaCart
Inspired by empirical studies of networked systems such as the Internet, social networks, and biological networks, researchers have in recent years developed a variety of techniques and models to help us understand or predict the behavior of these systems. Here we review developments in this field, including such concepts as the smallworld effect, degree distributions, clustering, network correlations, random graph models, models of network growth and preferential attachment, and dynamical processes taking place on networks.
Results 1  10
of
457,371