Results 1  10
of
12,032
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 783 (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
Smooth Stabilization Implies Coprime Factorization
, 1989
"... This paper shows that coprime right factorizations exist for the input to state mapping of a continuous time nonlinear system provided that the smooth feedback stabilization problem be solvable for this system. In particular, it follows that feedback linearizable systems admit such factorizations. I ..."
Abstract

Cited by 472 (62 self)
 Add to MetaCart
. In order to establish the result a Lyapunovtheoretic definition is proposed for "bounded input bounded output" stability. The main technical fact proved relates the notion of stabilizability studied in the state space nonlinear control literature to a notion of stability under bounded control
Joint Channel Assignment and Routing for Throughput Optimization in Multiradio Wireless Mesh Networks
, 2005
"... Multihop infrastructure wireless mesh networks offer increased reliability, coverage and reduced equipment costs over their singlehop counterpart, wireless LANs. Equipping wireless routers with multiple radios further improves the capacity by transmitting over multiple radios simultaneously using o ..."
Abstract

Cited by 443 (0 self)
 Add to MetaCart
orthogonal channels. Efficient channel assignment and routing is essential for throughput optimization of mesh clients. Efficient channel assignment schemes can greatly relieve the interference effect of closeby transmissions; effective routing schemes can alleviate potential congestion on any gateways
Edgebreaker: Connectivity compression for triangle meshes
 IEEE Transactions on Visualization and Computer Graphics
, 1999
"... Edgebreaker is a simple scheme for compressing the triangle/vertex incidence graphs (sometimes called connectivity or topology) of threedimensional triangle meshes. Edgebreaker improves upon the worst case storage required by previously reported schemes, most of which require O(nlogn) bits to store ..."
Abstract

Cited by 298 (24 self)
 Add to MetaCart
Edgebreaker is a simple scheme for compressing the triangle/vertex incidence graphs (sometimes called connectivity or topology) of threedimensional triangle meshes. Edgebreaker improves upon the worst case storage required by previously reported schemes, most of which require O(nlogn) bits
An information flow model for conflict and fission in small groups
 J. Anthropolog. Res
, 1977
"... Data from a voluntary association are used to construct a new formal model for a traditional anthropological problem, fission in small groups. The process leading to fission is viewed as an unequal flow of sentiments and information across the ties in a social network. This flow is unequal because i ..."
Abstract

Cited by 380 (0 self)
 Add to MetaCart
allows an accurate prediction of membership in the subgroups and of the locus of the fission to be made from measurements of the potential for information flow across each edge in the network. Methods for measurement of potential information flow are discussed, and it is shown that all appropriate
The impact of imperfect scheduling on crosslayer congestion control in wireless networks
, 2005
"... In this paper, we study crosslayer design for congestion control in multihop wireless networks. In previous work, we have developed an optimal crosslayer congestion control scheme that jointly computes both the rate allocation and the stabilizing schedule that controls the resources at the under ..."
Abstract

Cited by 349 (32 self)
 Add to MetaCart
layer congestion control will be impacted if the network can only use an imperfect (and potentially distributed) scheduling component that is easier to implement. We study both the case when the number of users in the system is fixed and the case with dynamic arrivals and departures of the users, and we establish
On the Scale and Performance of Cooperative Web Proxy Caching
 ACM Symposium on Operating Systems Principles
, 1999
"... While algorithms for cooperative proxy caching have been widely studied, little is understood about cooperativecaching performance in the largescale World Wide Web environment. This paper uses both tracebased analysis and analytic modelling to show the potential advantages and drawbacks of inter ..."
Abstract

Cited by 313 (15 self)
 Add to MetaCart
While algorithms for cooperative proxy caching have been widely studied, little is understood about cooperativecaching performance in the largescale World Wide Web environment. This paper uses both tracebased analysis and analytic modelling to show the potential advantages and drawbacks of inter
An analysis of temporaldifference learning with function approximation
 IEEE Transactions on Automatic Control
, 1997
"... We discuss the temporaldifference learning algorithm, as applied to approximating the costtogo function of an infinitehorizon discounted Markov chain. The algorithm weanalyze updates parameters of a linear function approximator online, duringasingle endless trajectory of an irreducible aperiodi ..."
Abstract

Cited by 313 (8 self)
 Add to MetaCart
aperiodic Markov chain with a finite or infinite state space. We present a proof of convergence (with probability 1), a characterization of the limit of convergence, and a bound on the resulting approximation error. Furthermore, our analysis is based on a new line of reasoning that provides new intuition
ROAMing Terrain: Realtime Optimally Adapting Meshes
, 1997
"... Terrain visualization is a difficult problem for applications requiring accurate images of large datasets at high frame rates, such as flight simulation and groundbased aircraft testing using synthetic sensor stimulation. On current graphics hardware, the problem is to maintain dynamic, viewdepend ..."
Abstract

Cited by 287 (10 self)
 Add to MetaCart
dependent triangle meshes and texture maps that produce good images at the required frame rate. We present an algorithm for constructing triangle meshes that optimizes flexible viewdependent error metrics, produces guaranteed error bounds, achieves specified triangle counts directly, and uses frame
Variational characterisation of Gibbs measures with Delaunay triangle interaction
, 2009
"... This paper deals with stationary Gibbsian point processes on the plane with an interaction that depends on the tiles of the Delaunay triangulation of points via a bounded triangle potential. It is shown that the class of these Gibbs processes includes all minimisers of the associated free energy den ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
This paper deals with stationary Gibbsian point processes on the plane with an interaction that depends on the tiles of the Delaunay triangulation of points via a bounded triangle potential. It is shown that the class of these Gibbs processes includes all minimisers of the associated free energy
Results 1  10
of
12,032