Sciweavers

288 search results - page 4 / 58
» Notes on computing minimal approximant bases
Sort
View
PG
1999
IEEE
14 years 2 months ago
Mesh Approximation Using a Volume-Based Metric
In this paper we introduce a mesh approximation method that uses a volume-based metric. After a geometric simplification, we minimize the volume between the simplified mesh and th...
Pierre Alliez, Nathalie Laurent, Henri Sanson, Fra...
IWVF
2001
Springer
14 years 2 months ago
Computational Surface Flattening: A Voxel-Based Approach
ÐA voxel-based method for flattening a surface in 3D space into 2D while best preserving distances is presented. Triangulation or polyhedral approximation of the voxel data are no...
Ruth Grossmann, Nahum Kiryati, Ron Kimmel
DATE
2010
IEEE
131views Hardware» more  DATE 2010»
14 years 3 months ago
Spinto: High-performance energy minimization in spin glasses
—With the prospect of atomic-scale computing, we study cumulative energy profiles of spin-spin interactions in nonferromagnetic lattices (Ising spin-glasses)—an established to...
Héctor J. Garcia, Igor L. Markov
CIKM
2000
Springer
14 years 2 months ago
Dimensionality Reduction and Similarity Computation by Inner Product Approximations
—As databases increasingly integrate different types of information such as multimedia, spatial, time-series, and scientific data, it becomes necessary to support efficient retri...
Ömer Egecioglu, Hakan Ferhatosmanoglu
CPM
2000
Springer
160views Combinatorics» more  CPM 2000»
14 years 2 months ago
Approximation Algorithms for Hamming Clustering Problems
We study Hamming versions of two classical clustering problems. The Hamming radius p-clustering problem (HRC) for a set S of k binary strings, each of length n, is to find p bina...
Leszek Gasieniec, Jesper Jansson, Andrzej Lingas