Sciweavers

1240 search results - page 171 / 248
» Computational Structure of coordinate transformations: A gen...
Sort
View
DM
2006
128views more  DM 2006»
15 years 6 months ago
Non-trivial t-designs without repeated blocks exist for all t
A computer package is being developed at Bayreuth for the generation and investigation of discrete structures. The package is a C and C++ class library of powerful algorithms endow...
Luc Teirlinck
ICDE
2009
IEEE
155views Database» more  ICDE 2009»
16 years 25 days ago
SPROUT: Lazy vs. Eager Query Plans for Tuple-Independent Probabilistic Databases
— A paramount challenge in probabilistic databases is the scalable computation of confidences of tuples in query results. This paper introduces an efficient secondary-storage o...
Dan Olteanu, Jiewen Huang, Christoph Koch
BMCBI
2006
192views more  BMCBI 2006»
15 years 6 months ago
Analysis of circular genome rearrangement by fusions, fissions and block-interchanges
Background: Analysis of genomes evolving via block-interchange events leads to a combinatorial problem of sorting by block-interchanges, which has been studied recently to evaluat...
Chin Lung Lu, Yen-Lin Huang, Tsui Ching Wang, Hsie...
ICDT
2010
ACM
141views Database» more  ICDT 2010»
15 years 10 months ago
The Complexity of Rooted Phylogeny problems
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...
Manuel Bodirsky, Jens K. Mueller
IJFCS
2007
111views more  IJFCS 2007»
15 years 6 months ago
Involutively Bordered Words
In this paper we study a generalization of the classical notions of bordered and unbordered words, motivated by DNA computing. DNA strands can be viewed as finite strings over th...
Lila Kari, Kalpana Mahalingam