Results 1  10
of
602,510
Formulae and growth rates of highdimensional polycubes
 COMBINATORICA
, 2010
"... A ddimensional polycube is a facetconnected set of cubes in d dimensions. Fixed polycubes are considered distinct if they differ in their shape or orientation. A proper ddimensional polycube spans all the d dimensions, that is, the convex hull of the centers of its cubes is ddimensional. In this ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
. In this paper we prove rigorously some (previously conjectured) closed formulae for fixed (proper and improper) polycubes, and show that the growthrate limit of the number of polycubes in d dimensions is 2ed − o(d). We conjecture that it is asymptotically equal to (2d − 3)e + O(1/d).
Estimating the Support of a HighDimensional Distribution
, 1999
"... Suppose you are given some dataset drawn from an underlying probability distribution P and you want to estimate a "simple" subset S of input space such that the probability that a test point drawn from P lies outside of S is bounded by some a priori specified between 0 and 1. We propo ..."
Abstract

Cited by 766 (29 self)
 Add to MetaCart
Suppose you are given some dataset drawn from an underlying probability distribution P and you want to estimate a "simple" subset S of input space such that the probability that a test point drawn from P lies outside of S is bounded by some a priori specified between 0 and 1. We propose a method to approach this problem by trying to estimate a function f which is positive on S and negative on the complement. The functional form of f is given by a kernel expansion in terms of a potentially small subset of the training data; it is regularized by controlling the length of the weight vector in an associated feature space. The expansion coefficients are found by solving a quadratic programming problem, which we do by carrying out sequential optimization over pairs of input patterns. We also provide a preliminary theoretical analysis of the statistical performance of our algorithm. The algorithm is a natural extension of the support vector algorithm to the case of unlabelled d...
Probabilistic Roadmaps for Path Planning in HighDimensional Configuration Spaces
 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION
, 1996
"... A new motion planning method for robots in static workspaces is presented. This method proceeds in two phases: a learning phase and a query phase. In the learning phase, a probabilistic roadmap is constructed and stored as a graph whose nodes correspond to collisionfree configurations and whose edg ..."
Abstract

Cited by 1276 (124 self)
 Add to MetaCart
A new motion planning method for robots in static workspaces is presented. This method proceeds in two phases: a learning phase and a query phase. In the learning phase, a probabilistic roadmap is constructed and stored as a graph whose nodes correspond to collisionfree configurations and whose edges correspond to feasible paths between these configurations. These paths are computed using a simple and fast local planner. In the query phase, any given start and goal configurations of the robot are connected to two nodes of the roadmap; the roadmap is then searched for a path joining these two nodes. The method is general and easy to implement. It can be applied to virtually any type of holonomic robot. It requires selecting certain parameters (e.g., the duration of the learning phase) whose values depend on the scene, that is the robot and its workspace. But these values turn out to be relatively easy to choose, Increased efficiency can also be achieved by tailoring some components of the method (e.g., the local planner) to the considered robots. In this paper the method is applied to planar articulated robots with many degrees of freedom. Experimental results show that path planning can be done in a fraction of a second on a contemporary workstation (=150 MIPS), after learning for relatively short periods of time (a few dozen seconds)
Induction of Decision Trees
 MACH. LEARN
, 1986
"... The technology for building knowledgebased systems by inductive inference from examples has been demonstrated successfully in several practical applications. This paper summarizes an approach to synthesizing decision trees that has been used in a variety of systems, and it describes one such syste ..."
Abstract

Cited by 4303 (4 self)
 Add to MetaCart
The technology for building knowledgebased systems by inductive inference from examples has been demonstrated successfully in several practical applications. This paper summarizes an approach to synthesizing decision trees that has been used in a variety of systems, and it describes one
Scalable Recognition with a Vocabulary Tree
 IN CVPR
, 2006
"... A recognition scheme that scales efficiently to a large number of objects is presented. The efficiency and quality is exhibited in a live demonstration that recognizes CDcovers from a database of 40000 images of popular music CD's. The scheme ..."
Abstract

Cited by 1043 (0 self)
 Add to MetaCart
A recognition scheme that scales efficiently to a large number of objects is presented. The efficiency and quality is exhibited in a live demonstration that recognizes CDcovers from a database of 40000 images of popular music CD's. The scheme
Mining Frequent Patterns without Candidate Generation: A FrequentPattern Tree Approach
 DATA MINING AND KNOWLEDGE DISCOVERY
, 2004
"... Mining frequent patterns in transaction databases, timeseries databases, and many other kinds of databases has been studied popularly in data mining research. Most of the previous studies adopt an Apriorilike candidate set generationandtest approach. However, candidate set generation is still co ..."
Abstract

Cited by 1700 (64 self)
 Add to MetaCart

based mining method, FPgrowth, for mining the complete set of frequent patterns by pattern fragment growth.
Efficiency of mining is achieved with three techniques: (1) a large database is compressed into a condensed,
smaller data structure, FPtree which avoids costly, repeated database scans, (2) our
Financial Intermediation and Growth: Causality and Causes
 JOURNAL OF MONETARY ECONOMICS
, 2000
"... This paper evaluates (1) whether the exogenous component of financial intermediary development influences economic growth and (2) whether crosscountry differences in legal and accounting systems (e.g., creditor rights, contract enforcement, and accounting standards) explain differences in the level ..."
Abstract

Cited by 788 (71 self)
 Add to MetaCart
This paper evaluates (1) whether the exogenous component of financial intermediary development influences economic growth and (2) whether crosscountry differences in legal and accounting systems (e.g., creditor rights, contract enforcement, and accounting standards) explain differences
Those who understand: Knowledge growth in teaching. Educational Researcher
, 1986
"... "He who can, does. He who cannot, teaches. “ 1 don't know in what fit of pique George Bernard Shaw wrote that infamous aphorism, words that have plagued members of the teaching profession for nearly a century. They are found in "Maxims for Revolutionists, " an appendix to his pl ..."
Abstract

Cited by 1272 (1 self)
 Add to MetaCart
"He who can, does. He who cannot, teaches. “ 1 don't know in what fit of pique George Bernard Shaw wrote that infamous aphorism, words that have plagued members of the teaching profession for nearly a century. They are found in "Maxims for Revolutionists, " an appendix to his play Man and Superman. "He who can, does. He who cannot, teaches" is a calamitous insult to our profession, yet one readily repeated even by teachers. More worrisome, its philosophy often appears to underlie the policies concerning the occupation and activities of teaching. Where did such a demeaning image of the teacher's capacities originate? How long have we been burdened by assumptions of ignorance and ineptitude within the teaching corps? Is Shaw to be treated as the last word on what teachers know and don't know, or do and can't do? Yesterday's Examinations We begin our inquiry into conceptions of teacher knowledge with the tests for teachers that were used in this country during the last century This paper was a Presidential Address at the 1985 annual meeting of
Application of Phylogenetic Networks in Evolutionary Studies
 SUBMITTED TO MBE 2005
, 2005
"... The evolutionary history of a set of taxa is usually represented by a phylogenetic tree, and this model has greatly facilitated the discussion and testing of hypotheses. However, it is well known that more complex evolutionary scenarios are poorly described by such models. Further, even when evoluti ..."
Abstract

Cited by 867 (15 self)
 Add to MetaCart
The evolutionary history of a set of taxa is usually represented by a phylogenetic tree, and this model has greatly facilitated the discussion and testing of hypotheses. However, it is well known that more complex evolutionary scenarios are poorly described by such models. Further, even when
Greedy Function Approximation: A Gradient Boosting Machine
 Annals of Statistics
, 2000
"... Function approximation is viewed from the perspective of numerical optimization in function space, rather than parameter space. A connection is made between stagewise additive expansions and steepest{descent minimization. A general gradient{descent \boosting" paradigm is developed for additi ..."
Abstract

Cited by 951 (12 self)
 Add to MetaCart
additive components are regression trees, and tools for interpreting such \TreeBoost" models are presented. Gradient boosting of regression trees produces competitive, highly robust, interpretable procedures for both regression and classication, especially appropriate for mining less than clean
Results 1  10
of
602,510