Sciweavers

2414 search results - page 483 / 483
» Computing Normal Subgroups
Sort
View
ESA
2009
Springer
107views Algorithms» more  ESA 2009»
14 years 2 months ago
Disproof of the Neighborhood Conjecture with Implications to SAT
We study a special class of binary trees. Our results have implications on Maker/Breaker games and SAT: We disprove a conjecture of Beck on positional games and construct an unsati...
Heidi Gebauer
COMPGEOM
2006
ACM
14 years 1 months ago
Locked and unlocked chains of planar shapes
We extend linkage unfolding results from the well-studied case of polygonal linkages to the more general case of linkages of polygons. More precisely, we consider chains of nonove...
Robert Connelly, Erik D. Demaine, Martin L. Demain...
BMCBI
2007
144views more  BMCBI 2007»
13 years 7 months ago
InPrePPI: an integrated evaluation method based on genomic context for predicting protein-protein interactions in prokaryotic ge
Background: Although many genomic features have been used in the prediction of proteinprotein interactions (PPIs), frequently only one is used in a computational method. After rea...
Jingchun Sun, Yan Sun, Guohui Ding, Qi Liu, Chuan ...
SIAMCOMP
2002
138views more  SIAMCOMP 2002»
13 years 7 months ago
Phase Change of Limit Laws in the Quicksort Recurrence under Varying Toll Functions
We characterize all limit laws of the quicksort type random variables defined recursively by Xn d = XIn + X n-1-In + Tn when the "toll function" Tn varies and satisfies ...
Hsien-Kuei Hwang, Ralph Neininger