Sciweavers

1200 search results - page 2 / 240
» Marked Ancestor Problems
Sort
View
SWAT
1994
Springer
120views Algorithms» more  SWAT 1994»
13 years 9 months ago
Parallel Dynamic Lowest Common Ancestors
This paper gives a CREW PRAM algorithm for the problem of finding lowest common ancestors in a forest under the insertion of leaves and roots and the deletion of leaves. For a fore...
Erik Schenk
ISMB
2001
13 years 7 months ago
Using mixtures of common ancestors for estimating the probabilities of discrete events in biological sequences
Accurately estimating probabilities from observations is important for probabilistic-based approaches to problems in computational biology. In this paper we present a biologically...
Eleazar Eskin, William Noble Grundy, Yoram Singer
IJCAI
1989
13 years 6 months ago
Reducing the Derivation of Redundant Clauses in Reasoning Systems
This paper addresses two problems concerning the issue of redundant information in resolution based reasoning systems. The first one deals with the question, how the derivation of...
Rolf Socher-Ambrosius
IMR
2004
Springer
13 years 11 months ago
Mark-It: A Marking User Interface for Cutting Decomposition Time
We present Mark-It, a marking user interface that reduced the time to decompose a set of CAD models exhibiting a range of decomposition problems by as much as fifty percent. Inst...
Nicholas C. Yang, Andrew S. Forsberg, Jason F. She...
ACTAC
2002
90views more  ACTAC 2002»
13 years 5 months ago
The Home Marking Problem and Some Related Concepts
: In this paper we study the home marking problem for Petri nets, and some related concepts to it like confluence, noetherianity, and state space inclusion. We show that the home m...
Roxana Melinte, Olivia Oanea, Ioana Olga, Ferucio ...