Sciweavers

1434 search results - page 162 / 287
» Stochastic computation
Sort
View
SDM
2011
SIAM
414views Data Mining» more  SDM 2011»
14 years 6 months ago
Clustered low rank approximation of graphs in information science applications
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
Berkant Savas, Inderjit S. Dhillon
138
Voted
SIBGRAPI
2006
IEEE
15 years 10 months ago
Adapted Dynamic Meshes for Deformable Surfaces
Deformable objects play an important role in many applications, such as animation and simulation. Effective computation with deformable surfaces can be achieved through the use of...
Fernando de Goes, Felipe P. G. Bergo, Alexandre X....
124
Voted
WABI
2005
Springer
15 years 9 months ago
Rotamer-Pair Energy Calculations Using a Trie Data Structure
Abstract. Protein design software places amino acid side chains by precomputing rotamer-pair energies and optimizing rotamer placement. If the software optimizes by rapid stochasti...
Andrew Leaver-Fay, Brian Kuhlman, Jack Snoeyink
ACL
2009
15 years 1 months ago
Learning to Tell Tales: A Data-driven Approach to Story Generation
Computational story telling has sparked great interest in artificial intelligence, partly because of its relevance to educational and gaming applications. Traditionally, story gen...
Neil McIntyre, Mirella Lapata
121
Voted
TOG
2010
97views more  TOG 2010»
14 years 10 months ago
A practical simulation of dispersed bubble flow
In this paper, we propose a simple and efficient framework for simulating dispersed bubble flow. Instead of modeling the complex hydrodynamics of numerous small bubbles explicitly...
Doyub Kim, Oh-Young Song, Hyeong-Seok Ko