Sciweavers

202 search results - page 7 / 41
» A more efficient approximation scheme for tree alignment
Sort
View
ICFP
2008
ACM
14 years 7 months ago
Efficient nondestructive equality checking for trees and graphs
The Revised6 Report on Scheme requires its generic equivalence predicate, equal?, to terminate even on cyclic inputs. While the terminating equal? can be implemented via a DFA-equ...
Michael D. Adams, R. Kent Dybvig
VRST
1997
ACM
13 years 11 months ago
View volume culling using a probabilistic caching scheme
This paper describes a new algorithm for view volume culling. During an interactive walkthrough of a 3D scene, at any moment a large proportion of objects will be outside of the v...
Mel Slater, Yiorgos Chrysanthou
ASPDAC
2010
ACM
155views Hardware» more  ASPDAC 2010»
13 years 5 months ago
Efficient model reduction of interconnects via double gramians approximation
The gramian approximation methods have been proposed recently to overcome the high computing costs of classical balanced truncation based reduction methods. But those methods typi...
Boyuan Yan, Sheldon X.-D. Tan, Gengsheng Chen, Yic...
AMAI
2004
Springer
14 years 1 months ago
New Look-Ahead Schemes for Constraint Satisfaction
This paper presents new look-ahead schemes for backtracking search when solving constraint satisfaction problems. The look-ahead schemes compute a heuristic for value ordering and...
Kalev Kask, Rina Dechter, Vibhav Gogate
TKDE
2008
175views more  TKDE 2008»
13 years 7 months ago
Efficient Phrase-Based Document Similarity for Clustering
Phrase has been considered as a more informative feature term for improving the effectiveness of document clustering. In this paper, we propose a phrase-based document similarity t...
Hung Chim, Xiaotie Deng