Sciweavers

5350 search results - page 324 / 1070
» Space and time in eco-ontologies
Sort
View
CCCG
2007
15 years 8 months ago
Fast Computation of Smallest Enclosing Circle with Center on a Query Line Segment
Here we propose an efficient algorithm for computing the smallest enclosing circle whose center is constrained to lie on a query line segment. Our algorithm preprocesses a given s...
Arindam Karmakar, Sasanka Roy, Sandip Das
IJCBDD
2008
113views more  IJCBDD 2008»
15 years 6 months ago
Parsimony accelerated Maximum Likelihood searches
: Phylogenetic search is a key tool used in a variety of biological research endeavors. However, this search problem is known to be computationally difficult, due to the astronomic...
Kenneth Sundberg, Timothy O'Connor, Hyrum Carroll,...
IPL
2010
71views more  IPL 2010»
15 years 5 months ago
New common ancestor problems in trees and directed acyclic graphs
We derive a new generalization of lowest common ancestors (LCAs) in dags, called the lowest single common ancestor (LSCA). We show how to preprocess a static dag in linear time su...
Johannes Fischer, Daniel H. Huson
CORR
2006
Springer
145views Education» more  CORR 2006»
15 years 6 months ago
Algebraic Signal Processing Theory
In [1], we presented the algebraic signal processing theory, an axiomatic and general framework for linear signal processing. The basic concept in this theory is the signal model d...
Markus Püschel, José M. F. Moura
ICALP
2009
Springer
16 years 7 months ago
Fast FAST
We present a randomized subexponential time, polynomial space parameterized algorithm for the k-Weighted Feedback Arc Set in Tournaments (k-FAST) problem. We also show that our alg...
Noga Alon, Daniel Lokshtanov, Saket Saurabh