Sciweavers

7006 search results - page 1295 / 1402
» Approximation Algorithms
Sort
View
124
Voted
DAS
2010
Springer
15 years 4 months ago
Nearest neighbor based collection OCR
Conventional optical character recognition (OCR) systems operate on individual characters and words, and do not normally exploit document or collection context. We describe a Coll...
K. Pramod Sankar, C. V. Jawahar, Raghavan Manmatha
110
Voted
SODA
2001
ACM
87views Algorithms» more  SODA 2001»
15 years 2 months ago
Steiner points in tree metrics don't (really) help
Consider an edge-weighted tree T = (V, E, w : E R+ ), in which a subset R of the nodes (called the required nodes) are colored red and the remaining nodes in S = V \R are colored ...
Anupam Gupta
119
Voted
BMCBI
2008
140views more  BMCBI 2008»
15 years 28 days ago
Improved accuracy of multiple ncRNA alignment by incorporating structural information into a MAFFT-based framework
Background: Structural alignment of RNAs is becoming important, since the discovery of functional non-coding RNAs (ncRNAs). Recent studies, mainly based on various approximations ...
Kazutaka Katoh, Hiroyuki Toh
CGF
2006
126views more  CGF 2006»
15 years 26 days ago
Soft Shadow Maps: Efficient Sampling of Light Source Visibility
Shadows, particularly soft shadows, play an important role in the visual perception of a scene by providing visual cues about the shape and position of objects. Several recent alg...
Lionel Atty, Nicolas Holzschuch, Marc Lapierre, Je...
93
Voted
ECCV
2004
Springer
16 years 2 months ago
Unifying Approaches and Removing Unrealistic Assumptions in Shape from Shading: Mathematics Can Help
This article proposes a solution of the Lambertian Shape From Shading (SFS) problem by designing a new mathematical framework based on the notion of viscosity solutions. The power ...
Emmanuel Prados, Olivier D. Faugeras
« Prev « First page 1295 / 1402 Last » Next »