Sciweavers

373 search results - page 22 / 75
» Counting in Trees for Free
Sort
View
ICALP
2009
Springer
14 years 9 months ago
Counting Subgraphs via Homomorphisms
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
Omid Amini, Fedor V. Fomin, Saket Saurabh
IANDC
2011
148views more  IANDC 2011»
13 years 3 months ago
Building species trees from larger parts of phylogenomic databases
Abstract. Gene trees are leaf-labeled trees inferred from molecular sequences. Due to duplication events arising in genome evolution, gene trees usually have multiple copies of som...
Celine Scornavacca, Vincent Berry, Vincent Ranwez
CORR
2008
Springer
74views Education» more  CORR 2008»
13 years 8 months ago
Biased Range Trees
A data structure, called a biased range tree, is presented that preprocesses a set S of n points in R2 and a query distribution D for 2-sided orthogonal range counting queries. The...
Vida Dujmovic, John Howat, Pat Morin
DRMTICS
2005
Springer
14 years 2 months ago
Call Tree Transformation for Program Obfuscation and Copy Protection
In this paper we propose a new scheme for software obfuscation and license protection that is based on an original transformation of the program’s call tree. The idea is based on...
Valery Pryamikov
ACL
2012
11 years 11 months ago
Estimating Compact Yet Rich Tree Insertion Grammars
We present a Bayesian nonparametric model for estimating tree insertion grammars (TIG), building upon recent work in Bayesian inference of tree substitution grammars (TSG) via Dir...
Elif Yamangil, Stuart M. Shieber