Sciweavers

2412 search results - page 289 / 483
» Which Problems Have Strongly Exponential Complexity
Sort
View
138
Voted
PODS
2007
ACM
171views Database» more  PODS 2007»
16 years 3 months ago
Monadic datalog over finite structures with bounded treewidth
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
Georg Gottlob, Reinhard Pichler, Fang Wei
156
Voted
PLDI
2010
ACM
15 years 8 months ago
Adversarial memory for detecting destructive races
Multithreaded programs are notoriously prone to race conditions, a problem exacerbated by the widespread adoption of multi-core processors with complex memory models and cache coh...
Cormac Flanagan, Stephen N. Freund
172
Voted
AIIDE
2009
15 years 4 months ago
Using Semantics to Improve the Design of Game Worlds
Design of game worlds is becoming more and more laborintensive because of the increasing demand and complexity of content. This is being partially addressed by developing semi-aut...
Tim Tutenel, Ruben Michaël Smelik, Rafael Bid...
136
Voted
BMCBI
2008
104views more  BMCBI 2008»
15 years 3 months ago
ReRep: Computational detection of repetitive sequences in genome survey sequences (GSS)
Background: Genome survey sequences (GSS) offer a preliminary global view of a genome since, unlike ESTs, they cover coding as well as non-coding DNA and include repetitive region...
Thomas D. Otto, Leonardo H. F. Gomes, Marcelo Alve...
159
Voted
BMCBI
2007
151views more  BMCBI 2007»
15 years 3 months ago
Identification of hot regions in protein-protein interactions by sequential pattern mining
Background: Identification of protein interacting sites is an important task in computational molecular biology. As more and more protein sequences are deposited without available...
Chen-Ming Hsu, Chien-Yu Chen, Baw-Jhiune Liu, Chih...