Sciweavers

3281 search results - page 255 / 657
» Bases for parametrized iterativity
Sort
View
DAC
2005
ACM
15 years 8 months ago
Performance simulation modeling for fast evaluation of pipelined scalar processor by evaluation reuse
This paper proposes a rapid and accurate evaluation scheme for cycle counts of a pipelined processor using evaluation reuse technique. Since exploration of an optimal processor is...
Ho Young Kim, Tag Gon Kim
AAAI
2006
15 years 8 months ago
An Edge Deletion Semantics for Belief Propagation and its Practical Impact on Approximation Quality
We show in this paper that the influential algorithm of iterative belief propagation can be understood in terms of exact inference on a polytree, which results from deleting enoug...
Arthur Choi, Adnan Darwiche
163
Voted
CASCON
1997
98views Education» more  CASCON 1997»
15 years 8 months ago
Similarity-based retrieval for diverse bookshelf software repository users
The paper presents a similarity-based retrieval framework for a software repository that aids the process of maintaining, understanding, and migrating legacy software systems [12]...
Igor Jurisica
EUROGRAPHICS
2010
Eurographics
15 years 7 months ago
Fast and Efficient Skinning of Animated Meshes
Skinning is a simple yet popular deformation technique combining compact storage with efficient hardware accelerated rendering. While skinned meshes (such as virtual characters) a...
Ladislav Kavan, Peter-Pike Sloan, Carol O'Sullivan
CORR
2008
Springer
111views Education» more  CORR 2008»
15 years 6 months ago
Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Crossings
We provide linear-time algorithms for geometric graphs with sublinearly many crossings. That is, we provide algorithms running in O(n) time on connected geometric graphs having n ...
David Eppstein, Michael T. Goodrich, Darren Strash