Sciweavers

692 search results - page 35 / 139
» Combinatorics of Partial Derivatives
Sort
View
CPM
2006
Springer
95views Combinatorics» more  CPM 2006»
15 years 8 months ago
New Bounds for Motif Finding in Strong Instances
Many algorithms for motif finding that are commonly used in bioinformatics start by sampling r potential motif occurrences from n input sequences. The motif is derived from these s...
Brona Brejová, Daniel G. Brown, Ian M. Harr...
COCOON
2008
Springer
15 years 6 months ago
Average-Case Competitive Analyses for One-Way Trading
Consider a trader who exchanges one dollar into yen and assume that the exchange rate fluctuates within the interval [m, M]. The game ends without advance notice, then the trader ...
Hiroshi Fujiwara, Kazuo Iwama, Yoshiyuki Sekiguchi
DAGSTUHL
1996
15 years 5 months ago
A Comparative Revisitation of Some Program Transformation Techniques
We revisit the main techniques of program transformation which are used in partial evaluation, mixed computation, supercompilation, generalized partial computation, rule-based prog...
Alberto Pettorossi, Maurizio Proietti
ICALP
2010
Springer
15 years 9 months ago
Dynamic Programming for Graphs on Surfaces
Abstract. We provide a framework for the design and analysis of dynamic programming algorithms for surface-embedded graphs on n vertices and branchwidth at most k. Our technique ap...
Juanjo Rué, Ignasi Sau, Dimitrios M. Thilik...
ISIPTA
2005
IEEE
146views Mathematics» more  ISIPTA 2005»
15 years 10 months ago
Arithmetic on Random Variables: Squeezing the Envelopes with New Joint Distribution Constraints
Uncertainty is a key issue in decision analysis and other kinds of applications. Researchers have developed a number of approaches to address computations on uncertain quantities....
Jianzhong Zhang 0004, Daniel Berleant