Results 1  10
of
1,088
Dynamic Bayesian Networks: Representation, Inference and Learning
, 2002
"... Modelling sequential data is important in many areas of science and engineering. Hidden Markov models (HMMs) and Kalman filter models (KFMs) are popular for this because they are simple and flexible. For example, HMMs have been used for speech recognition and biosequence analysis, and KFMs have bee ..."
Abstract

Cited by 770 (3 self)
 Add to MetaCart
been used for problems ranging from tracking planes and missiles to predicting the economy. However, HMMs
and KFMs are limited in their “expressive power”. Dynamic Bayesian Networks (DBNs) generalize HMMs by allowing the state space to be represented in factored form, instead of as a single discrete
An improved data stream summary: The CountMin sketch and its applications
 J. Algorithms
, 2004
"... Abstract. We introduce a new sublinear space data structure—the CountMin Sketch — for summarizing data streams. Our sketch allows fundamental queries in data stream summarization such as point, range, and inner product queries to be approximately answered very quickly; in addition, it can be applie ..."
Abstract

Cited by 413 (43 self)
 Add to MetaCart
be applied to solve several important problems in data streams such as finding quantiles, frequent items, etc. The time and space bounds we show for using the CM sketch to solve these problems significantly improve those previously known — typically from 1/ε 2 to 1/ε in factor. 1
Tractable inference for complex stochastic processes
 In Proc. UAI
, 1998
"... The monitoring and control of any dynamic system depends crucially on the ability to reason about its current status and its future trajectory. In the case of a stochastic system, these tasks typically involve the use of a belief state—a probability distribution over the state of the process at a gi ..."
Abstract

Cited by 302 (14 self)
 Add to MetaCart
given point in time. Unfortunately, the state spaces of complex processes are very large, making an explicit representation of a belief state intractable. Even in dynamic Bayesian networks (DBNs), where the process itself can be represented compactly, the representation of the belief state
Understanding the NetworkLevel Behavior of Spammers
, 2006
"... This paper studies the networklevel behavior of spammers, including: IP address ranges that send the most spam, common spamming modes (e.g., BGP route hijacking, bots), how persistent across time each spamming host is, and characteristics of spamming botnets. We try to answer these questions by ana ..."
Abstract

Cited by 290 (22 self)
 Add to MetaCart
This paper studies the networklevel behavior of spammers, including: IP address ranges that send the most spam, common spamming modes (e.g., BGP route hijacking, bots), how persistent across time each spamming host is, and characteristics of spamming botnets. We try to answer these questions
Improved memorybounded dynamic programming for decentralized POMDPs
 In Proceedings of the TwentyThird Conference on Uncertainty in Artificial Intelligence
, 2007
"... Decentralized decision making under uncertainty has been shown to be intractable when each agent has different partial information about the domain. Thus, improving the applicability and scalability of planning algorithms is an important challenge. We present the first memorybounded dynamic program ..."
Abstract

Cited by 94 (22 self)
 Add to MetaCart
Decentralized decision making under uncertainty has been shown to be intractable when each agent has different partial information about the domain. Thus, improving the applicability and scalability of planning algorithms is an important challenge. We present the first memorybounded dynamic
Labeled RTDP: Improving the convergence of realtime dynamic programming
 In ICAPS’03, 12–21
"... RTDP is a recent heuristicsearch DP algorithm for solving nondeterministic planning problems with full observability. In relation to other dynamic programming methods, RTDP has two benefits: first, it does not have to evaluate the entire state space in order to deliver an optimal policy, and secon ..."
Abstract

Cited by 131 (10 self)
 Add to MetaCart
RTDP is a recent heuristicsearch DP algorithm for solving nondeterministic planning problems with full observability. In relation to other dynamic programming methods, RTDP has two benefits: first, it does not have to evaluate the entire state space in order to deliver an optimal policy
A Realtime Garbage Collector with Low Overhead and Consistent Utilization
, 2003
"... Now that the use of garbage collection in languages like Java is becoming widely accepted due to the safety and software engineering benefits it provides, there is significant interest in applying garbage collection to hard realtime systems. Past approaches have generally suffered from one of two m ..."
Abstract

Cited by 166 (22 self)
 Add to MetaCart
major flaws: either they were not provably realtime, or they imposed large space overheads to meet the realtime bounds. We present a mostly nonmoving, dynamically defragmenting collector that overcomes both of these limitations: by avoiding copying in most cases, space requirements are kept low
Combinatorial Geometry
, 1995
"... Abstract. Let P be a set of n points in ~d (where d is a small fixed positive integer), and let F be a collection of subsets of ~d, each of which is defined by a constant number of bounded degree polynomial inequalities. We consider the following Frange searching problem: Given P, build a data stru ..."
Abstract

Cited by 185 (24 self)
 Add to MetaCart
structure for efficient answering of queries of the form, "Given a 7 ~ F, count (or report) the points of P lying in 7." Generalizing the simplex range searching techniques, we give a solution with nearly linear space and preprocessing time and with O(n 1 x/b+~) query time, where d < b
Dynamic range selection in linear space
 IN: PROCEEDINGS OF THE 22ND INTERNATIONAL SYMPOSIUM ON ALGORITHMS AND COMPUTATION
, 2011
"... Given a set S of n points in the plane, we consider the problem of answering range selection queries on S: that is, given an arbitrary xrange Q and an integer k> 0, return the kth smallest ycoordinate from the set of points that have xcoordinates in Q. We present a linear space data structu ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
structure that maintains a dynamic set of n points in the plane with real coordinates, and supports range selection queries in O((lgn / lg lgn)²) time, as well as insertions and deletions in O((lgn / lg lgn)²) amortized time. The space usage of this data structure is an Θ(lgn / lg lgn) factor improvement
Coil sensitivity encoding for fast MRI. In:
 Proceedings of the ISMRM 6th Annual Meeting,
, 1998
"... New theoretical and practical concepts are presented for considerably enhancing the performance of magnetic resonance imaging (MRI) by means of arrays of multiple receiver coils. Sensitivity encoding (SENSE) is based on the fact that receiver sensitivity generally has an encoding effect complementa ..."
Abstract

Cited by 193 (3 self)
 Add to MetaCart
configurations and kspace sampling patterns. Special attention is given to the currently most practical case, namely, sampling a common Cartesian grid with reduced density. For this case the feasibility of the proposed methods was verified both in vitro and in vivo. Scan time was reduced to onehalf using a two
Results 1  10
of
1,088