330 search results - page 14 / 66 » Isosurfacing in higher dimensions |
COMPGEOM
1995
ACM
13 years 11 months ago
1995
ACM
We present a simple but powerful new probabilistic technique for analyzing the combinatorial complexity of various substructures in arrangements of piecewise-linear surfaces in hig...
SISAP
2008
IEEE
14 years 2 months ago
2008
IEEE
There are several pieces of information that can be utilized in order to improve the efficiency of similarity searches on high-dimensional data. The most commonly used information...
VISUALIZATION
2003
IEEE
14 years 27 days ago
2003
IEEE
This paper introduces a method for converting an image or volume sampled on a regular grid into a space-efficient irregular point hierarchy. The conversion process retains the ori...
MCS
2008
Springer
13 years 7 months ago
2008
Springer
Dynamical low-rank approximation is a differential-equation based approach to efficiently computing low-rank approximations to time-dependent large data matrices or to solutions o...
BIBE
2007
IEEE
14 years 2 months ago
2007
IEEE
—We investigate the k-LCS problem that is finding a longest common subsequence (LCS) for k given input strings. The problem is known to have practical solutions for k = 2, but f...