Sciweavers

2652 search results - page 222 / 531
» Positioning using local maps
Sort
View
BMCBI
2008
128views more  BMCBI 2008»
15 years 6 months ago
Pairwise covariance adds little to secondary structure prediction but improves the prediction of non-canonical local structure
Background: Amino acid sequence probability distributions, or profiles, have been used successfully to predict secondary structure and local structure in proteins. Profile models ...
Christopher Bystroff, Bobbie-Jo M. Webb-Robertson
IPL
2007
105views more  IPL 2007»
15 years 6 months ago
A new algorithm for testing if a regular language is locally threshold testable
A new algorithm is presented for testing if a regular language is locally threshold testable. The new algorithm is slower than existing algorithms, but its correctness proof is sh...
Mikolaj Bojanczyk
JMLR
2002
102views more  JMLR 2002»
15 years 6 months ago
Optimal Structure Identification With Greedy Search
In this paper we prove the so-called "Meek Conjecture". In particular, we show that if a DAG H is an independence map of another DAG G, then there exists a finite sequen...
David Maxwell Chickering
COCO
2009
Springer
115views Algorithms» more  COCO 2009»
16 years 1 months ago
Locally Testable Codes Require Redundant Testers
Locally testable codes (LTCs) are error-correcting codes for which membership, in the code, of a given word can be tested by examining it in very few locations. Most known constru...
Eli Ben-Sasson, Venkatesan Guruswami, Tali Kaufman...
GRAPHICSINTERFACE
2008
15 years 8 months ago
Quality scalability of soft shadow mapping
Recently, several soft shadow mapping algorithms have been introduced which extract micro-occluders from a shadow map and backproject them on the light source to approximately det...
Michael Schwarz, Marc Stamminger