Sciweavers

95 search results - page 18 / 19
» Lines, Trees, and Branch Spaces
Sort
View
SC
2003
ACM
13 years 11 months ago
Multi-Constraint Mesh Partitioning for Contact/Impact Computations
We present a novel approach for decomposing contact/impact computations in which the mesh elements come in contact with each other during the course of the simulation. Effective d...
George Karypis
KDD
1998
ACM
113views Data Mining» more  KDD 1998»
13 years 10 months ago
Targeting Business Users with Decision Table Classifiers
Business users and analysts commonly use spreadsheets and 2D plots to analyze and understand their data. On-line Analytical Processing (OLAP) provides these users with added flexi...
Ron Kohavi, Dan Sommerfield
CIKM
1994
Springer
13 years 10 months ago
Hashing by Proximity to Process Duplicates in Spatial Databases
In a spatial database, an object may extend arbitrarily in space. As a result, many spatial data structures e.g., the quadtree, the cell tree, the R+-tree represent an object by p...
Walid G. Aref, Hanan Samet
SODA
2001
ACM
105views Algorithms» more  SODA 2001»
13 years 7 months ago
Online point location in planar arrangements and its applications
Recently, Har-Peled [HP99b] presented a new randomized technique for online construction of the zone of a curve in a planar arrangement of arcs. In this paper, we present several ...
Sariel Har-Peled, Micha Sharir
VIS
2009
IEEE
211views Visualization» more  VIS 2009»
14 years 7 months ago
Isosurface Extraction and View-Dependent Filtering from Time-Varying Fields Using Persistent Time-Octree (PTOT)
We develop a new algorithm for isosurface extraction and view-dependent filtering from large time-varying fields, by using a novel Persistent Time-Octree (PTOT) indexing structure....
Cong Wang, Yi-Jen Chiang