Sciweavers

6693 search results - page 1086 / 1339
» Methods of Automatic Algorithm Generation
Sort
View
SIGGRAPH
1997
ACM
15 years 7 months ago
Interactive Boolean operations for conceptual design of 3-D solids
Interactive modeling of 3-D solids is an important and difficult problem in computer graphics. The Constructive Solid Geometry (CSG) modeling scheme is highly attractive for inte...
Ari Rappoport, Steven N. Spitz
TOG
2002
96views more  TOG 2002»
15 years 2 months ago
Robust epsilon visibility
Analytic visibility algorithms, for example methods which compute a subdivided mesh to represent shadows, are notoriously unrobust and hard to use in practice. We present a new me...
Florent Duguet, George Drettakis
BIBM
2010
IEEE
157views Bioinformatics» more  BIBM 2010»
15 years 1 months ago
Decomposing PPI networks for complex discovery
Abstract--Protein complexes are important for understanding principles of cellular organization and functions. With the availability of large amounts of high-throughput proteinprot...
Guimei Liu, Chern Han Yong, Limsoon Wong, Hon Nian...
SIGGRAPH
2003
ACM
15 years 8 months ago
Interactive rendering of translucent deformable objects
Realistic rendering of materials such as milk, fruits, wax, marble, and so on, requires the simulation of subsurface scattering of light. This paper presents an algorithm for plau...
Tom Mertens, Jan Kautz, Philippe Bekaert, Hans-Pet...
ICDT
2001
ACM
147views Database» more  ICDT 2001»
15 years 7 months ago
Parallelizing the Data Cube
This paper presents a general methodology for the efficient parallelization of existing data cube construction algorithms. We describe two different partitioning strategies, one f...
Frank K. H. A. Dehne, Todd Eavis, Susanne E. Hambr...
« Prev « First page 1086 / 1339 Last » Next »