Sciweavers

649 search results - page 57 / 130
» Visualization in string theory
Sort
View
ICSE
2001
IEEE-ACM
15 years 2 months ago
Using Transformation Systems for Software Maintenance and Reengineering
Software maintenance costs dominate software engineering costs, partly because most such engineering is done manually. Program Transformation tools leverage an engineer-provided b...
Ira D. Baxter
STOC
2000
ACM
156views Algorithms» more  STOC 2000»
15 years 2 months ago
Near optimal multiple alignment within a band in polynomial time
Multiple sequence alignment is a fundamental problem in computational biology. Because of its notorious difficulties, aligning sequences within a constant band (c-diagonal) is a ...
Ming Li, Bin Ma, Lusheng Wang
COCO
2006
Springer
93views Algorithms» more  COCO 2006»
15 years 1 months ago
Making Hard Problems Harder
We consider a general approach to the hoary problem of (im)proving circuit lower bounds. We define notions of hardness condensing and hardness extraction, in analogy to the corres...
Joshua Buresh-Oppenheim, Rahul Santhanam
ICDT
2010
ACM
147views Database» more  ICDT 2010»
15 years 1 months ago
Querying Parse Trees of Stochastic Context-Free Grammars
Stochastic context-free grammars (SCFGs) have long been recognized as useful for a large variety of tasks including natural language processing, morphological parsing, speech reco...
Sara Cohen, Benny Kimelfeld
CIKM
2008
Springer
14 years 11 months ago
TinyLex: static n-gram index pruning with perfect recall
Inverted indexes using sequences of characters (n-grams) as terms provide an error-resilient and language-independent way to query for arbitrary substrings and perform approximate...
Derrick Coetzee