Sciweavers

258 search results - page 19 / 52
» A fast natural Newton method
Sort
View
CORR
2011
Springer
198views Education» more  CORR 2011»
13 years 2 months ago
Pattern matching in Lempel-Ziv compressed strings: fast, simple, and deterministic
Countless variants of the Lempel-Ziv compression are widely used in many real-life applications. This paper is concerned with a natural modification of the classical pattern match...
Pawel Gawrychowski
CICLING
2009
Springer
13 years 11 months ago
Language Identification on the Web: Extending the Dictionary Method
Abstract. Automated language identification of written text is a wellestablished research domain that has received considerable attention in the past. By now, efficient and effecti...
Radim Rehurek, Milan Kolkus
ICMCS
2006
IEEE
82views Multimedia» more  ICMCS 2006»
14 years 1 months ago
Block-based Fast Compression for Compound Images
—This paper presents a novel block-based fast compression (BFC) algorithm for compound images that contain graphics, text and natural images. The images are divided to blocks, wh...
Wenpeng Ding, Dong Liu, Yuwen He, Feng Wu
CVPR
2008
IEEE
14 years 1 months ago
Fast kernel learning for spatial pyramid matching
Spatial pyramid matching (SPM) is a simple yet effective approach to compute similarity between images. Similarity kernels at different regions and scales are usually fused by som...
Junfeng He, Shih-Fu Chang, Lexing Xie
CGF
2010
98views more  CGF 2010»
13 years 7 months ago
Fast Generation of Pointerless Octree Duals
Geometry processing applications frequently rely on octree structures, since they provide simple and efficient hierarchies for discrete data. However, octrees do not guarantee dire...
Thomas Lewiner, Vinícius Mello, Adelailson ...