Results 1  10
of
392,735
Unsupervised Temporal Commonality Discovery
"... Abstract. Unsupervised discovery of commonalities in images has recently attracted much interest due to the need to find correspondences in large amounts of visual data. A natural extension, and a relatively unexplored problem, is how to discover common semantic temporal patterns in videos. That is, ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
sequence, making it impractical for regularlength sequences. This paper proposes an efficient branch and bound (B&B) algorithm to tackle the TCD problem. We derive tight bounds for classical distances between temporal bag of words of two segments, including ℓ1, intersection and χ 2. Using these bounds
Length Distributions and Regular Sequences
 CODES, SYSTEMS AND GRAPHICAL MODELS, IMA VOLUMES IN MATHEMATICS AND ITS APPLICATIONS
, 2000
"... This paper presents a survey on length distributions of regular languages. The accent is problems in coding theory and the relation with symbolic dynamics. ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
This paper presents a survey on length distributions of regular languages. The accent is problems in coding theory and the relation with symbolic dynamics.
Extracting paraphrases from a parallel corpus
 In Proc. of the ACL/EACL
, 2001
"... While paraphrasing is critical both for interpretation and generation of natural language, current systems use manual or semiautomatic methods to collect paraphrases. We present an unsupervised learning algorithm for identification of paraphrases from a corpus of multiple English translations of th ..."
Abstract

Cited by 252 (6 self)
 Add to MetaCart
While paraphrasing is critical both for interpretation and generation of natural language, current systems use manual or semiautomatic methods to collect paraphrases. We present an unsupervised learning algorithm for identification of paraphrases from a corpus of multiple English translations of the same source text. Our approach yields phrasal and single word lexical paraphrases as well as syntactic paraphrases. 1
Semiregular masas of transfinite length
 Internat. J. Math
"... In 1965 Tauer produced a countably infinite family of semiregular masas in the hyperfinite II1 factor, no pair of which are conjugate by an automorphism. This was achieved by iterating the process of passing to the algebra generated by the normalisers and, for each n ∈ N, finding masas for which th ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
In 1965 Tauer produced a countably infinite family of semiregular masas in the hyperfinite II1 factor, no pair of which are conjugate by an automorphism. This was achieved by iterating the process of passing to the algebra generated by the normalisers and, for each n ∈ N, finding masas for which
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 192 (3 self)
 Add to MetaCart
that in weak reconstruction FFT can still be applied if kspace is sampled in a regular Cartesian fashion. For this reason sensitivity encoding with Cartesian sampling is particularly feasible. Moreover, the reconstruction mechanism is relatively easily understood in this case. Therefore, the first part
The ASTOOT approach to testing objectoriented programs
 ACM Transactions on Software Engineering
, 1994
"... This article describes a new approach to the unit testing of objectoriented programs, a set of tools based on this approach, and two case studies. In this approach, each test case consists of a tuple of sequences of messages, along with tags indicating whether these sequences should put objects of ..."
Abstract

Cited by 182 (1 self)
 Add to MetaCart
, but the test execution tool can be used when no formal specification is available. Using the test execution tools, case studies involving execution of tens of thousands of test cases, with various sequence lengths, parameters, and combinations of operations were performed. The relationships among likelihood
Biextensions By Indecomposable Modules of Derived Regular Length 2
, 1997
"... this paper `algebra' means a connected, basic, finitedimensional algebra (associative, with 1) over an algebraically closed field k. For an algebra A we denote by A\Gammamod ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
this paper `algebra' means a connected, basic, finitedimensional algebra (associative, with 1) over an algebraically closed field k. For an algebra A we denote by A\Gammamod
A Formal Approach to Recovery by Compensating Transactions
 In Proceedings of the 16th International Conference on Very Large Data Bases
, 1990
"... Compensating transactions are intended to handle situations where it is required to undo either committed or uncommitted transactions that affect other transactions, without resorting to cascading aborts. This stands in sharp contrast to the standard approach to transaction recovery where cascading ..."
Abstract

Cited by 171 (5 self)
 Add to MetaCart
Compensating transactions are intended to handle situations where it is required to undo either committed or uncommitted transactions that affect other transactions, without resorting to cascading aborts. This stands in sharp contrast to the standard approach to transaction recovery where cascading aborts are avoided by requiring transactions to read only committed data, and where committed transactions are treated as permanent and irreversible. We argue that this standard approach to recovery is not suitable for a wide range of advanced database applications, in particular those applications that incorporate longduration or nested transactions. We show how compensating transactions can be effectively used to handle these types of applications. We present a model that allows the definition of a variety of types of correct compensation. These types of compensation range from traditional undo, at one extreme, to applicationdependent, specialpurpose compensating transactions, ...
Sequence into
"... Our pilot experiment has revealed that certain types of clones seem difficult to be rewritten as a shared code even if they are found as clones. Examples are a code portion that begins at the middle of a function definition and ends at the middle of another function definition, and a code portion th ..."
Abstract
 Add to MetaCart
an entire function definition can become a candidate for clone. • Regularization of identifiers Recent programming languages such as C++ and Java provide name space and/or generic type. As a result, identifiers often appear with attributive identifiers of name space and/or template arguments. In order
Results 1  10
of
392,735