Sciweavers

446 search results - page 34 / 90
» A fast algorithm for computing steiner edge connectivity
Sort
View
TVCG
2008
128views more  TVCG 2008»
14 years 9 months ago
AD-Frustum: Adaptive Frustum Tracing for Interactive Sound Propagation
We present an interactive algorithm to compute sound propagation paths for transmission, specular reflection and edge diffraction in complex scenes. Our formulation uses an adaptiv...
Anish Chandak, Christian Lauterbach, Micah T. Tayl...
PG
2000
IEEE
15 years 2 months ago
A New Paradigm for Changing Topology during Subdivision Modeling
In this paper, we present a new paradigm that allows dynamically changing the topology of 2-manifold polygonal meshes. Our new paradigm always guarantees topological consistency o...
Ergun Akleman, Vinod Srinivasan, Jianer Chen
PG
1999
IEEE
15 years 1 months ago
An Improved TIN Compression Using Delaunay Triangulation
In this paper we introduce a new compression technique for the connectivity of a Triangulated Irregular Network (TIN) by using Delaunay triangulation. The strategy in this paper i...
Yang-Soo Kim, Dong-Gyu Park, Ho-Youl Jung, Hwan-Gu...
TNN
2008
152views more  TNN 2008»
14 years 9 months ago
Distributed Parallel Support Vector Machines in Strongly Connected Networks
We propose a distributed parallel support vector machine (DPSVM) training mechanism in a configurable network environment for distributed data mining. The basic idea is to exchange...
Yumao Lu, Vwani P. Roychowdhury, L. Vandenberghe
ICS
2000
Tsinghua U.
15 years 1 months ago
Fast greedy weighted fusion
Loop fusion is important to optimizing compilers because it is an important tool in managing the memory hierarchy. By fusing loops that use the same data elements, we can reduce t...
Ken Kennedy