Results 1  10
of
5,602
Tree/Branch Decompositions and Their Applications
"... The notions of tree decompositions and branch decompositions have received much attention in discrete optimizations. These notions were originally introduced by Robertson and Seymour [15, 16] in the proof of the Graph Minors Theorem, known as Wagner’s conjecture. It is known that practical problems ..."
Abstract
 Add to MetaCart
The notions of tree decompositions and branch decompositions have received much attention in discrete optimizations. These notions were originally introduced by Robertson and Seymour [15, 16] in the proof of the Graph Minors Theorem, known as Wagner’s conjecture. It is known that practical problems
A ContextTree BranchWeighting Algorithm
"... The contexttree weighting algorithm [4] is a universal source coding algorithm for binary tree sources. In [2] the algorithm is modified for byteoriented tree sources. This paper describes the contexttree branchweighting algorithm, which can reduce the number of parameters for such sources, with ..."
Abstract
 Add to MetaCart
The contexttree weighting algorithm [4] is a universal source coding algorithm for binary tree sources. In [2] the algorithm is modified for byteoriented tree sources. This paper describes the contexttree branchweighting algorithm, which can reduce the number of parameters for such sources
Cetin, “Wavelet Based Detection of Moving Tree Branches and
 Leaves in Video”, IEEE Int. Symposium on Circuits and Systems, ISCAS 2006
"... Abstract—A method for detection of tree branches and leaves in video is proposed. It is observed that the motion vectors of tree branches and leaves exhibit random motion. On the other hand regular motion of green colored objects has welldefined directions. In this paper, the wavelet transform of m ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract—A method for detection of tree branches and leaves in video is proposed. It is observed that the motion vectors of tree branches and leaves exhibit random motion. On the other hand regular motion of green colored objects has welldefined directions. In this paper, the wavelet transform
Nonparametric model for background subtraction
 in ECCV ’00
, 2000
"... Abstract. Background subtraction is a method typically used to segment moving regions in image sequences taken from a static camera by comparing each new frame to a model of the scene background. We present a novel nonparametric background model and a background subtraction approach. The model can ..."
Abstract

Cited by 545 (17 self)
 Add to MetaCart
can handle situations where the background of the scene is cluttered and not completely static but contains small motions such as tree branches and bushes. The model estimates the probability of observing pixel intensity values based on a sample of intensity values for each pixel. The model adapts
A Simple, Fast, and Accurate Algorithm to Estimate Large Phylogenies by Maximum Likelihood
, 2003
"... The increase in the number of large data sets and the complexity of current probabilistic sequence evolution models necessitates fast and reliable phylogeny reconstruction methods. We describe a new approach, based on the maximumlikelihood principle, which clearly satisfies these requirements. The ..."
Abstract

Cited by 2182 (27 self)
 Add to MetaCart
. The core of this method is a simple hillclimbing algorithm that adjusts tree topology and branch lengths simultaneously. This algorithm starts from an initial tree built by a fast distancebased method and modifies this tree to improve its likelihood at each iteration. Due to this simultaneous adjustment
PAML: a program package for phylogenetic analysis by maximum likelihood
 COMPUT APPL BIOSCI 13:555–556
, 1997
"... PAML, currently in version 1.2, is a package of programs for phylogenetic analyses of DNA and protein sequences using the method of maximum likelihood (ML). The programs can be used for (i) maximum likelihood estimation of evolutionary parameters such as branch lengths in a phylogenetic tree, the tr ..."
Abstract

Cited by 1459 (17 self)
 Add to MetaCart
PAML, currently in version 1.2, is a package of programs for phylogenetic analyses of DNA and protein sequences using the method of maximum likelihood (ML). The programs can be used for (i) maximum likelihood estimation of evolutionary parameters such as branch lengths in a phylogenetic tree
Nearest neighbor queries.
 ACM SIGMOD Record,
, 1995
"... Abstract A frequently encountered type of query in Geographic Information Systems is to nd the k nearest neighbor objects to a given point in space. Processing such queries requires substantially di erent search algorithms than those for location or range queries. In this paper we present a n e cie ..."
Abstract

Cited by 592 (1 self)
 Add to MetaCart
cient branchandbound Rtree traversal algorithm to nd the nearest neighbor object to a point, and then generalize it to nding the k nearest neighbors. We also discuss metrics for an optimistic and a pessimistic search ordering strategy as well as for pruning. Finally, w e present the results
Symbolic Model Checking for Realtime Systems
 INFORMATION AND COMPUTATION
, 1992
"... We describe finitestate programs over realnumbered time in a guardedcommand language with realvalued clocks or, equivalently, as finite automata with realvalued clocks. Model checking answers the question which states of a realtime program satisfy a branchingtime specification (given in an ..."
Abstract

Cited by 578 (50 self)
 Add to MetaCart
We describe finitestate programs over realnumbered time in a guardedcommand language with realvalued clocks or, equivalently, as finite automata with realvalued clocks. Model checking answers the question which states of a realtime program satisfy a branchingtime specification (given
Mega: molecular evolutionary genetic analysis software for microcomputers
 CABIOS
, 1994
"... A computer program package called MEGA has been developed for estimating evolutionary distances, reconstructing phylogenetic trees and computing basic statistical quantities from molecular data. It is written in C+ + and is intended to be used on IBM and IBMcompatible personal computers. In this pr ..."
Abstract

Cited by 505 (10 self)
 Add to MetaCart
A computer program package called MEGA has been developed for estimating evolutionary distances, reconstructing phylogenetic trees and computing basic statistical quantities from molecular data. It is written in C+ + and is intended to be used on IBM and IBMcompatible personal computers
A TreeBranch Searching, Multiresolution Approach
 in Image Processing, Kenneth M. Hanson, Editor, Proc. SPIE
, 2000
"... One of the most important tasks for virtual endoscopy is path planning for viewing the lumen of hollow organs. For geometry complex objects, for example the lungs, it remains an unsolved problem. While alternative visualization modes have been proposed, for example, cutting and flattening the hollow ..."
Abstract
 Add to MetaCart
to the root can be extracted based on this distance map. A postprocessing algorithm is applied to the shortest paths to remove redundant ones and to centralize the remained ones. The skeleton generated is one voxel wide, along which every branch of the "tree" can be viewed. For effectively
Results 1  10
of
5,602