Sciweavers

2412 search results - page 219 / 483
» Which Problems Have Strongly Exponential Complexity
Sort
View
DNA
2006
Springer
15 years 7 months ago
Hairpin Structures Defined by DNA Trajectories
We examine scattered hairpins, which are structures formed when a single strand of nucleotides folds into a partially hybridized stem and a loop. To specify different classes of h...
Michael Domaratzki
BMCBI
2007
144views more  BMCBI 2007»
15 years 3 months ago
Motif kernel generated by genetic programming improves remote homology and fold detection
Background: Protein remote homology detection is a central problem in computational biology. Most recent methods train support vector machines to discriminate between related and ...
Tony Håndstad, Arne J. H. Hestnes, Pål...
INFOCOM
2011
IEEE
14 years 7 months ago
Risk sensitive optimal control framework applied to delay tolerant networks
—Epidemics dynamics can describe the dissemination of information in delay tolerant networks, in peer to peer networks and in content delivery networks. The control of such dynam...
Eitan Altman, Veeraruna Kavitha, Francesco De Pell...
VR
2008
IEEE
128views Virtual Reality» more  VR 2008»
15 years 10 months ago
GVT: a platform to create virtual environments for procedural training
The use of Virtual Environments for Training is strongly stimulated by important needs for training on sensitive equipments. Yet, developing such an application is often done with...
Stéphanie Gerbaud, Nicolas Mollet, Franck G...
COCO
2010
Springer
129views Algorithms» more  COCO 2010»
15 years 7 months ago
On the Relative Strength of Pebbling and Resolution
The last decade has seen a revival of interest in pebble games in the context of proof complexity. Pebbling has proven to be a useful tool for studying resolution-based proof syst...
Jakob Nordström