Results 1  10
of
538
Efficient Management of Transitive Relationships
 in Large Data and Knowledge Bases,” in Proc. ACM Symp. on Management of Data (SIGMOD
, 1989
"... We argue that accessing the transitive closure of relationsbips is an important component of both databases and knowledge representation systems in Artificial Intelligence. The demands for efficient access and management of large relationships motivate the need for explicitly storing the transitive ..."
Abstract

Cited by 161 (3 self)
 Add to MetaCart
closure in a compressed and local way, while allowing updates to the base relation to be propagated incrementally. We present a transitive closure compression technique, based on labeling spanning trees with numeric intervals, and provide both analytical and empirical evidence of its efficacy, including a
Detecting Unusual Activity in Video
, 2004
"... We present an unsupervised technique for detecting unusual activity in a large video set using many simple features. No complex activity models and no supervised feature selections are used. We divide the video into equal length segments and classify the extracted features into prototypes, from whic ..."
Abstract

Cited by 182 (0 self)
 Add to MetaCart
which a prototypesegment cooccurrence matrix is computed. Motivated by a similar problem in documentkeyword analysis, we seek a correspondence relationship between prototypes and video segments which satisfies the transitive closure constraint. We show that an important subfamily of correspondence
Regular Model Checking
, 2000
"... . We present regular model checking, a framework for algorithmic verification of infinitestate systems with, e.g., queues, stacks, integers, or a parameterized linear topology. States are represented by strings over a finite alphabet and the transition relation by a regular lengthpreserving re ..."
Abstract

Cited by 164 (25 self)
 Add to MetaCart
preserving relation on strings. Major problems in the verification of parameterized and infinitestate systems are to compute the set of states that are reachable from some set of initial states, and to compute the transitive closure of the transition relation. We present two complementary techniques
Estimating the Size of the Transitive Closure
, 1996
"... e within a factor of 1 + ffi of the true answer. The size of the transitive closure of a graph will be denoted by T , where T = P v2V js(v)j. ust as for s(v), our algorithm can find estimates for T which lie within 1 + ffi factor of T with high probability in O( ffi 2 d ln(n)) time. The core of ou ..."
Abstract
 Add to MetaCart
e within a factor of 1 + ffi of the true answer. The size of the transitive closure of a graph will be denoted by T , where T = P v2V js(v)j. ust as for s(v), our algorithm can find estimates for T which lie within 1 + ffi factor of T with high probability in O( ffi 2 d ln(n)) time. The core
Segmentation of multivariate mixed data via lossy coding and compression
 IEEE Transactions on Pattern Analysis and Machine Intelligence
, 2007
"... Abstract—In this paper, based on ideas from lossy data coding and compression, we present a simple but effective technique for segmenting multivariate mixed data that are drawn from a mixture of Gaussian distributions, which are allowed to be almost degenerate. The goal is to find the optimal segmen ..."
Abstract

Cited by 106 (15 self)
 Add to MetaCart
Abstract—In this paper, based on ideas from lossy data coding and compression, we present a simple but effective technique for segmenting multivariate mixed data that are drawn from a mixture of Gaussian distributions, which are allowed to be almost degenerate. The goal is to find the optimal
Structure Analysis of Soccer Video with Domain Knowledge and Hidden Markov Models
, 2003
"... In this paper, we present statistical techniques for parsing the structure of produced soccer programs. The problem is important for applications such as personalized video streaming and browsing systems, in which video are segmented into di#erent states and important states are selected based on us ..."
Abstract

Cited by 149 (21 self)
 Add to MetaCart
characteristics of soccer videos. We then model the stochastic structures of each state of the game with a set of hidden Markov models. Finally, higherlevel transitions are taken into account and dynamic programming techniques are used to obtain the maximum likelihood segmentation of the video sequence
Computing Transitive Closures of Hedge Transformations
"... We consider the framework of regular hedge model checking where configurations are represented by trees of arbitrary arities, sets of configurations are represented by regular hedge automata, and the dynamic of a system is modeled by a term rewriting system. We consider the problem of computing the ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
procedure computes the exact reachability set in many practical applications. We have successfully applied our technique to compute transitive closures for some mutual exclusion protocols defined on arbitrary width tree topologies, as well as for two interesting XML applications.
Fully Dynamic Transitive Closure: Breaking Through The O(n²) Barrier
 IN PROC. IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE
, 2000
"... In this paper we introduce a general framework for casting fully dynamic transitive closure into the problem of reevaluating polynomials over matrices. With this technique, we improve the best known bounds for fully dynamic transitive closure. In particular, we devise a deterministic algorithm for g ..."
Abstract

Cited by 45 (7 self)
 Add to MetaCart
In this paper we introduce a general framework for casting fully dynamic transitive closure into the problem of reevaluating polynomials over matrices. With this technique, we improve the best known bounds for fully dynamic transitive closure. In particular, we devise a deterministic algorithm
Dynamic shortest paths and transitive closure: algorithmic techniques and data structures
 J. DISCR. ALGOR
, 2006
"... In this paper, we survey fully dynamic algorithms for path problems on general directed graphs. In particular, we consider two fundamental problems: dynamic transitive closure and dynamic shortest paths. Although research on these problems spans over more than three decades, in the last couple of ye ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
In this paper, we survey fully dynamic algorithms for path problems on general directed graphs. In particular, we consider two fundamental problems: dynamic transitive closure and dynamic shortest paths. Although research on these problems spans over more than three decades, in the last couple
Efficient implementation of lattice operations
 ACM Transactions on Programming Languages and Systems
, 1989
"... complementation (BUTNOT) are becoming more and more important in programming languages supporting object inheritance. We present a general technique for the efficient implementation of such operations based on an encoding method. The effect of the encoding is to plunge the given ordering into a bool ..."
Abstract

Cited by 127 (9 self)
 Add to MetaCart
boolean lattice of binary words, leading to an almost constant time complexity of the lattice operations. A first method is described based on a transitive closure approach. Then a more spaceefficient method minimizing codeword length is described. Finally a powerful grouping technique called
Results 1  10
of
538