Sciweavers

2969 search results - page 260 / 594
» A space efficient algorithm for group structure computation
Sort
View
SIGGRAPH
2000
ACM
15 years 8 months ago
Conservative volumetric visibility with occluder fusion
Visibility determination is a key requirement in a wide range of graphics algorithms. This paper introduces a new approach to the computation of volume visibility, the detection o...
Gernot Schaufler, Julie Dorsey, Xavier Déco...
SDM
2008
SIAM
138views Data Mining» more  SDM 2008»
15 years 5 months ago
Learning Markov Network Structure using Few Independence Tests
In this paper we present the Dynamic Grow-Shrink Inference-based Markov network learning algorithm (abbreviated DGSIMN), which improves on GSIMN, the state-ofthe-art algorithm for...
Parichey Gandhi, Facundo Bromberg, Dimitris Margar...
SIGGRAPH
1994
ACM
15 years 8 months ago
A fast shadow algorithm for area light sources using backprojection
The fast identification of shadow regions due to area light sources is necessary for realistic rendering and for discontinuity meshing for global illumination. A new shadow-determ...
George Drettakis, Eugene Fiume
WALCOM
2010
IEEE
230views Algorithms» more  WALCOM 2010»
15 years 11 months ago
Comparing RNA Structures with Biologically Relevant Operations Cannot Be Done without Strong Combinatorial Restrictions
Abstract. Arc-annotated sequences are useful for representing structural information of RNAs and have been extensively used for comparing RNA structures in both terms of sequence a...
Guillaume Blin, Sylvie Hamel, Stéphane Vial...
110
Voted
OOPSLA
1997
Springer
15 years 7 months ago
Efficient Type Inclusion Tests
A type inclusion test determines whether one type is a subtype of another. Efficient type testing techniques exist for single subtyping, but not for languages with multiple subtyp...
Jan Vitek, R. Nigel Horspool, Andreas Krall