Sciweavers

175 search results - page 8 / 35
» Partially Ordered Runs: A Case Study
Sort
View
BIRTHDAY
2003
Springer
14 years 17 days ago
Sweepline the Music!
Abstract. The problem of matching sets of points or sets of horizontal line segments in plane under translations is considered. For finding the exact occurrences of a point set of...
Esko Ukkonen, Kjell Lemström, Veli Mäkin...
DM
2006
91views more  DM 2006»
13 years 7 months ago
Fast perfect sampling from linear extensions
In this paper, we study the problem of sampling (exactly) uniformly from the set of linear extensions of an arbitrary partial order. Previous Markov chain techniques have yielded ...
Mark Huber
BMCBI
2010
129views more  BMCBI 2010»
13 years 7 months ago
The LabelHash Algorithm for Substructure Matching
Background: There is an increasing number of proteins with known structure but unknown function. Determining their function would have a significant impact on understanding diseas...
Mark Moll, Drew H. Bryant, Lydia E. Kavraki
SODA
2012
ACM
212views Algorithms» more  SODA 2012»
11 years 9 months ago
Parallelism and time in hierarchical self-assembly
We study the role that parallelism plays in time complexariants of Winfree’s abstract Tile Assembly Model (aTAM), a model of molecular algorithmic self-assembly. In the “hiera...
Ho-Lin Chen, David Doty
CIKM
2006
Springer
13 years 11 months ago
Heuristic containment check of partial tree-pattern queries in the presence of index graphs
The wide adoption of XML has increased the interest of the database community on tree-structured data management techniques. Querying capabilities are provided through tree-patter...
Dimitri Theodoratos, Stefanos Souldatos, Theodore ...