Results 1  10
of
353,473
Adaptive Partitioning of Urban Facades
"... Figure 1: Given input unorganized point clouds of 3D urban facades, a recursive adaptive partitioning is automatically performed to build a hierarchy of building blocks upon them (from left to right). The splitting direction, number and location of splitting planes are all adaptively determined in e ..."
Abstract

Cited by 21 (0 self)
 Add to MetaCart
Figure 1: Given input unorganized point clouds of 3D urban facades, a recursive adaptive partitioning is automatically performed to build a hierarchy of building blocks upon them (from left to right). The splitting direction, number and location of splitting planes are all adaptively determined
Flux: An Adaptive Partitioning Operator for Continuous Query Systems
 In ICDE
, 2002
"... The longrunning nature of continuous queries poses new scalability challenges for dataflow processing. CQ systems execute pipelined dataflows that may be shared across multiple queries. The scalability of these dataflows is limited by their constituent, stateful operators  e.g. windowed joins or ..."
Abstract

Cited by 140 (5 self)
 Add to MetaCart
or grouping operators. To scale such operators, a natural solution is to partition them across a sharednothing platform. But in the CQ context, traditional, static techniques for partitioned parallelism can exhibit detrimental imbalances as workload and runtime conditions evolve. Longrunning CQ dataflows
Multivariate Convex Regression with Adaptive Partitioning
"... We propose a new, nonparametric method for multivariate regression subject to convexity or concavity constraints on the response function. Convexity constraints are common in economics, statistics, operations research, financial engineering and optimization, but there is currently no multivariate m ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
method that is stable and computationally feasible for more than a few thousand observations. We introduce convex adaptive partitioning (CAP), which creates a globally convex regression model from locally linear estimates fit on adaptively selected covariate partitions. CAP is a computationally
Multivariate adaptive regression splines
 The Annals of Statistics
, 1991
"... A new method is presented for flexible regression modeling of high dimensional data. The model takes the form of an expansion in product spline basis functions, where the number of basis functions as well as the parameters associated with each one (product degree and knot locations) are automaticall ..."
Abstract

Cited by 679 (2 self)
 Add to MetaCart
) are automatically determined by the data. This procedure is motivated by the recursive partitioning approach to regression and shares its attractive properties. Unlike recursive partitioning, however, this method produces continuous models with continuous derivatives. It has more power and flexibility to model
A fast and high quality multilevel scheme for partitioning irregular graphs
 SIAM JOURNAL ON SCIENTIFIC COMPUTING
, 1998
"... Recently, a number of researchers have investigated a class of graph partitioning algorithms that reduce the size of the graph by collapsing vertices and edges, partition the smaller graph, and then uncoarsen it to construct a partition for the original graph [Bui and Jones, Proc. ..."
Abstract

Cited by 1173 (16 self)
 Add to MetaCart
Recently, a number of researchers have investigated a class of graph partitioning algorithms that reduce the size of the graph by collapsing vertices and edges, partition the smaller graph, and then uncoarsen it to construct a partition for the original graph [Bui and Jones, Proc.
Classification Algorithms using Adaptive Partitioning
, 2012
"... binary classification, adaptive methods, set estimators, tree based algorithms, analysis of risk. Mathematics Subject Classifications: 62M45, 65D05, 68Q32, 97N50 ..."
Abstract

Cited by 28 (2 self)
 Add to MetaCart
binary classification, adaptive methods, set estimators, tree based algorithms, analysis of risk. Mathematics Subject Classifications: 62M45, 65D05, 68Q32, 97N50
Adaptive Partitionings for Fractal Image Compression
 Proc. IEEE Int. Conf. on Image Processing
, 1997
"... In fractal image compression a partitioning of the image into ranges is required. In our previous work [1] we have proposed to find good partitionings by means of a splitandmerge process guided by evolutionary computing. In this approach ranges are connected sets of small square image blocks. Far b ..."
Abstract

Cited by 22 (11 self)
 Add to MetaCart
In fractal image compression a partitioning of the image into ranges is required. In our previous work [1] we have proposed to find good partitionings by means of a splitandmerge process guided by evolutionary computing. In this approach ranges are connected sets of small square image blocks. Far
Adaptive clustering for mobile wireless networks
 IEEE Journal on Selected Areas in Communications
, 1997
"... This paper describes a selforganizing, multihop, mobile radio network, which relies on a code division access scheme for multimedia support. In the proposed network architecture, nodes are organized into nonoverlapping clusters. The clusters are independently controlled and are dynamically reconfig ..."
Abstract

Cited by 556 (11 self)
 Add to MetaCart
This paper describes a selforganizing, multihop, mobile radio network, which relies on a code division access scheme for multimedia support. In the proposed network architecture, nodes are organized into nonoverlapping clusters. The clusters are independently controlled and are dynamically reconfigured as nodes move. This network architecture has three main advantages. First, it provides spatial reuse of the bandwidth due to node clustering. Secondly, bandwidth can be shared or reserved in a controlled fashion in each cluster. Finally, the cluster algorithm is robust in the face of topological changes caused by node motion, node failure and node insertion/removal. Simulation shows that this architecture provides an efficient, stable infrastructure for the integration of different types of traffic in a dynamic radio network. 1.
Estimation of the information by an adaptive partitioning of the observation space
 IEEE Transactions on Information Theory
, 1999
"... Abstractâ€”We demonstrate that it is possible to approximate the mutual information arbitrarily closely in probability by calculating relative frequencies on appropriate partitions and achieving conditional independence on the rectangles of which the partitions are made. Empirical results, including a ..."
Abstract

Cited by 83 (0 self)
 Add to MetaCart
Abstractâ€”We demonstrate that it is possible to approximate the mutual information arbitrarily closely in probability by calculating relative frequencies on appropriate partitions and achieving conditional independence on the rectangles of which the partitions are made. Empirical results, including
A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks
, 1997
"... We present a new distributed routing protocol for mobile, multihop, wireless networks. The protocol is one of a family of protocols which we term "link reversal" algorithms. The protocol's reaction is structured as a temporallyordered sequence of diffusing computations; each computat ..."
Abstract

Cited by 1095 (6 self)
 Add to MetaCart
" of the distributed algorithm. This capability is unique among protocols which are stable in the face of network partitions, and results in the protocol's high degree of adaptivity. This desirable behavior is achieved through the novel use of a "physical or logical clock" to establish the "
Results 1  10
of
353,473