Results 1  10
of
1,554
Proving Properties of Incremental Merkle Trees
"... Abstract. This paper proves two basic properties of the model of a single attack pointfree event ordering system, developed by NTT. This model is based on an incremental construction of Merkle trees, and we show the correctness of (1) completion and (2) an incremental sanity check. These are mainly ..."
Abstract
 Add to MetaCart
Abstract. This paper proves two basic properties of the model of a single attack pointfree event ordering system, developed by NTT. This model is based on an incremental construction of Merkle trees, and we show the correctness of (1) completion and (2) an incremental sanity check
Convergent Treereweighted Message Passing for Energy Minimization
 ACCEPTED TO IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE (PAMI), 2006. ABSTRACTACCEPTED TO IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE (PAMI)
, 2006
"... Algorithms for discrete energy minimization are of fundamental importance in computer vision. In this paper we focus on the recent technique proposed by Wainwright et al. [33] treereweighted maxproduct message passing (TRW). It was inspired by the problem of maximizing a lower bound on the energy ..."
Abstract

Cited by 489 (16 self)
 Add to MetaCart
on the energy. However, the algorithm is not guaranteed to increase this bound it may actually go down. In addition, TRW does not always converge. We develop a modification of this algorithm which we call sequential treereweighted message passing. Its main property is that the bound is guaranteed
Reducing Multiclass to Binary: A Unifying Approach for Margin Classifiers
 JOURNAL OF MACHINE LEARNING RESEARCH
, 2000
"... We present a unifying framework for studying the solution of multiclass categorization problems by reducing them to multiple binary problems that are then solved using a marginbased binary learning algorithm. The proposed framework unifies some of the most popular approaches in which each class ..."
Abstract

Cited by 561 (20 self)
 Add to MetaCart
is compared against all others, or in which all pairs of classes are compared to each other, or in which output codes with errorcorrecting properties are used. We propose a general method for combining the classifiers generated on the binary problems, and we prove a general empirical multiclass loss bound
GromovWitten classes, quantum cohomology, and enumerative geometry
 Commun. Math. Phys
, 1994
"... The paper is devoted to the mathematical aspects of topological quantum field theory and its applications to enumerative problems of algebraic geometry. In particular, it contains an axiomatic treatment of Gromovâ€“Witten classes, and a discussion of their properties for Fano varieties. Cohomological ..."
Abstract

Cited by 474 (3 self)
 Add to MetaCart
Field Theories are defined, and it is proved that tree level theories are determined by their correlation functions. Application to counting rational curves on del Pezzo surfaces and projective spaces are given. Let V be a projective algebraic manifold. Methods of quantum field theory recently led to a
Policy gradient methods for reinforcement learning with function approximation.
 In NIPS,
, 1999
"... Abstract Function approximation is essential to reinforcement learning, but the standard approach of approximating a value function and determining a policy from it has so far proven theoretically intractable. In this paper we explore an alternative approach in which the policy is explicitly repres ..."
Abstract

Cited by 439 (20 self)
 Add to MetaCart
and in the statevisitation distribution. In this paper we prove that an unbiased estimate of the gradient (1) can be obtained from experience using an approximate value function satisfying certain properties. Our result also suggests a way of proving the convergence of a wide variety of algorithms based on "
Distance Browsing in Spatial Databases
, 1999
"... Two different techniques of browsing through a collection of spatial objects stored in an Rtree spatial data structure on the basis of their distances from an arbitrary spatial query object are compared. The conventional approach is one that makes use of a knearest neighbor algorithm where k is kn ..."
Abstract

Cited by 390 (21 self)
 Add to MetaCart
also usually outperforms the knearest neighbor algorithm when applied to the knearest neighbor problem for the Rtree, although the improvement is not nearly as large as for distance browsing queries. In fact, we prove informally that, at any step in its execution, the incremental...
Design and Analysis of an MSTBased Topology Control Algorithm
, 2002
"... In this paper, we present a Minimum Spanning Tree (MST) based topology control algorithm, called Local Minimum Spanning Tree (LMST), for wireless multihop networks. In this algorithm, each node builds its local minimum spanning tree independently and only keeps ontree nodes that are onehop away a ..."
Abstract

Cited by 278 (7 self)
 Add to MetaCart
as its neighbors in the final topology. We analytically prove several important properties of LMST: (1) the topology derived under LMST preserves the network connectivity; (2) the node degree of any node in the resulting topology is bounded by 6; and (3) the topology can be transformed into one with bi
Proved trees
 of Lecture Notes in Computer Science
, 1992
"... Abstract. An incremental parametric model is presented that permits to recover different descriptions of concurrent systems. Given a calculus, its semantics i defined through aprivileged transition system with transitions labelled by their proofs; then computations, i.e., paths in the transition sy ..."
Abstract

Cited by 41 (27 self)
 Add to MetaCart
system, are given a tree structure (proved trees). Different representation f the behaviour of a process are obtained by observing, ~,/a n observation function, the proved tree associated to the process. As an example, the paper shows how the interleaving, causal, and locational semantics
MBT: A MemoryBased Part of Speech TaggerGenerator
 PROC. OF FOURTH WORKSHOP ON VERY LARGE CORPORA
, 1996
"... We introduce a memorybased approach to part of speech tagging. Memorybased learning is a form of supervised learning based on similaritybased reasoning. The part of speech tag of a word in a particular context is extrapolated from the most similar cases held in memory. Supervised learning approac ..."
Abstract

Cited by 236 (56 self)
 Add to MetaCart
that is on a par with that of known statistical approaches, ad with attractive space and time complexity properties when using IGTree, a treebased formalism for indexing and searching huge case bases. The use of IGTree has as additional advantage that optimal context size for disambiguation is dynamically
Proving Properties of Programs by Structural Induction
 Computer Journal
, 1969
"... This paper discusses the technique of structural induction for proving theorems about programs. This technique is closely related to recursion induction but makes use of the inductive definition of the data structures handled by the programs. It treats programs with recursion but without assignments ..."
Abstract

Cited by 101 (0 self)
 Add to MetaCart
This paper discusses the technique of structural induction for proving theorems about programs. This technique is closely related to recursion induction but makes use of the inductive definition of the data structures handled by the programs. It treats programs with recursion but without
Results 1  10
of
1,554