Sciweavers

677 search results - page 120 / 136
» Bipartite roots of graphs
Sort
View
CATS
2008
13 years 10 months ago
Tractable Cases of the Extended Global Cardinality Constraint
We study the consistency problem for extended global cardinality (EGC) constraints. An EGC constraint consists of a set X of variables, a set D of values, a domain D(x) D for eac...
Marko Samer, Stefan Szeider
PSB
2004
13 years 9 months ago
Multiplexing Schemes for Generic SNP Genotyping Assays
Association studies in populations relate genomic variation among individuals with medical condition. Key to these studies is the development of efficient and affordable genotypin...
Roded Sharan, Amir Ben-Dor, Zohar Yakhini
BIRTHDAY
2010
Springer
13 years 9 months ago
Choiceless Computation and Symmetry
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...
Benjamin Rossman
FSTTCS
2009
Springer
14 years 3 months ago
Fractional Pebbling and Thrifty Branching Programs
We study the branching program complexity of the tree evaluation problem, introduced in [BCM+09a] as a candidate for separating NL from LogCFL. The input to the problem is a roote...
Mark Braverman, Stephen A. Cook, Pierre McKenzie, ...
ICDE
2004
IEEE
115views Database» more  ICDE 2004»
14 years 9 months ago
Unordered Tree Mining with Applications to Phylogeny
Frequent structure mining (FSM) aims to discover and extract patterns frequently occurring in structural data, such as trees and graphs. FSM finds many applications in bioinformat...
Dennis Shasha, Jason Tsong-Li Wang, Sen Zhang