Sciweavers

115 search results - page 21 / 23
» On the LVI-based numerical method (E47 algorithm) for solvin...
Sort
View
BIBE
2008
IEEE
142views Bioinformatics» more  BIBE 2008»
14 years 9 days ago
Optimizing performance, cost, and sensitivity in pairwise sequence search on a cluster of PlayStations
— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...
Ashwin M. Aji, Wu-chun Feng
TOG
2008
96views more  TOG 2008»
13 years 5 months ago
Display adaptive tone mapping
We propose a tone-mapping operator that can minimize visible contrast distortions for a range of output devices, ranging from e-paper to HDR displays. The operator weights contras...
Rafal Mantiuk, Scott Daly, Louis Kerofsky
IJCAI
1989
13 years 7 months ago
An Approximate Solver for Symbolic Equations
This paper describes a program, called NEWTON, that finds approximate symbolic solutions to parameterized equations in one variable. N E W T O N derives an initial approximation b...
Elisha Sacks
ICSM
2005
IEEE
13 years 11 months ago
Static Analysis of Object References in RMI-Based Java Software
Distributed applications provide numerous advantages related to software performance, reliability, interoperability, and extensibility. This paper focuses on distributed Java prog...
Mariana Sharp, Atanas Rountev
JGS
2006
154views more  JGS 2006»
13 years 5 months ago
Area-to-point Kriging with inequality-type data
In practical applications of area-to-point spatial interpolation, inequality constraints, such as non-negativity, or more general constraints on the maximum and/or minimum allowab...
E.-H. Yoo, Phaedon C. Kyriakidis