Sciweavers

2570 search results - page 177 / 514
» Fast Algorithms For The Computation Of Ranklets
Sort
View
111
Voted
ACCV
2006
Springer
15 years 9 months ago
Fast Image Replacement Using Multi-resolution Approach
We developed a system including two modules: the texture analysis module and the texture synthesis module. The analysis module is capable of analyzing an input image and performing...
Chih-Wei Fang, James Jenn-Jier Lien
ICFP
2005
ACM
15 years 9 months ago
Fast narrowing-driven partial evaluation for inductively sequential programs
Narrowing-driven partial evaluation is a powerful technique for the specialization of (first-order) functional and functional logic programs. However, although it gives good resu...
J. Guadalupe Ramos, Josep Silva, Germán Vid...
112
Voted
ICALP
2005
Springer
15 years 9 months ago
Randomized Fast Design of Short DNA Words
We consider the problem of efficiently designing sets (codes) of equal-length DNA strings (words) that satisfy certain combinatorial constraints. This problem has numerous motivati...
Ming-Yang Kao, Manan Sanghi, Robert T. Schweller
138
Voted
DAC
2003
ACM
15 years 8 months ago
Fast timing-driven partitioning-based placement for island style FPGAs
In this paper we propose a partitioning-based placement algorithm for FPGAs. The method incorporates simple, but effective heuristics that target delay minimization. The placement...
Pongstorn Maidee, Cristinel Ababei, Kia Bazargan
134
Voted
CGI
2000
IEEE
15 years 8 months ago
SQUEEZE: Fast and Progressive Decompression of Triangle Meshes
An ideal triangle mesh compression technology would simultaneously support the following three objectives: (1) progressive refinements of the received mesh during decompression, (...
Renato Pajarola, Jarek Rossignac