Sciweavers

2745 search results - page 80 / 549
» A fast algorithm for computing large Fibonacci numbers
Sort
View
VISUALIZATION
1997
IEEE
15 years 10 months ago
A topology modifying progressive decimation algorithm
Triangle decimation techniques reduce the number of triangles in a mesh, typically to improve interactive rendering performance or reduce data storage and transmission requirement...
William J. Schroeder
SDM
2004
SIAM
194views Data Mining» more  SDM 2004»
15 years 7 months ago
Finding Frequent Patterns in a Large Sparse Graph
Graph-based modeling has emerged as a powerful abstraction capable of capturing in a single and unified framework many of the relational, spatial, topological, and other characteri...
Michihiro Kuramochi, George Karypis
SDM
2010
SIAM
195views Data Mining» more  SDM 2010»
15 years 7 months ago
MACH: Fast Randomized Tensor Decompositions
Tensors naturally model many real world processes which generate multi-aspect data. Such processes appear in many different research disciplines, e.g, chemometrics, computer visio...
Charalampos E. Tsourakakis
CGI
2004
IEEE
15 years 10 months ago
Fast and High Quality Overlap Repair for Patch-Based Texture Synthesis
Patch-based texture synthesis has proven to produce high quality textures faster than pixel-based approaches. Previous algorithms differ in how the regions of overlap between neig...
Andrew Nealen, Marc Alexa
ICDE
2008
IEEE
159views Database» more  ICDE 2008»
16 years 7 months ago
Fast Graph Pattern Matching
Due to rapid growth of the Internet technology and new scientific/technological advances, the number of applications that model data as graphs increases, because graphs have high e...
Jiefeng Cheng, Jeffrey Xu Yu, Bolin Ding, Philip S...