Sciweavers

123 search results - page 16 / 25
» Algorithms for computing variants of the longest common subs...
Sort
View
CGI
2004
IEEE
13 years 11 months ago
Exploiting Temporal Coherence in Final Gathering for Dynamic Scenes
Efficient global illumination computation in dynamically changing environments is an important practical problem. In high-quality animation rendering costly "final gathering&...
Takehiro Tawara, Karol Myszkowski, Hans-Peter Seid...
CORR
2008
Springer
114views Education» more  CORR 2008»
13 years 7 months ago
Algorithmic Pricing via Virtual Valuations
Algorithmic pricing is the computational problem that sellers (e.g., in supermarkets) face when trying to set prices for their items to maximize their profit in the presence of a ...
Shuchi Chawla, Jason D. Hartline, Robert Kleinberg
CSB
2002
IEEE
121views Bioinformatics» more  CSB 2002»
14 years 22 days ago
Fast and Sensitive Algorithm for Aligning ESTs to Human Genome
There is a pressing need to align growing set of expressed sequence tags (ESTs) to newly sequenced human genome. The problem is, however, complicated by the exon/intron structure ...
Jun Ogasawara, Shinichi Morishita
DIAGRAMS
2006
Springer
13 years 11 months ago
Flow Diagrams: Rise and Fall of the First Software Engineering Notation
Drawings of water are the earliest, least abstract forms of flow diagram. Representations of ideal or generalised sequences for manufacturing or actual paths for materials between ...
Stephen J. Morris, O. C. Z. Gotel
ARITH
2003
IEEE
14 years 1 months ago
SRT Division Algorithms as Dynamical Systems
SRT division, as it was discovered in the late 1950s represented an important improvement in the speed of division algorithms for computers at the time. A variant of SRT division ...
Mark McCann, Nicholas Pippenger