Sciweavers

6943 search results - page 1053 / 1389
» Representations for evolutionary algorithms
Sort
View
SIGGRAPH
2000
ACM
15 years 11 months ago
Patching Catmull-Clark meshes
Named after the title, the PCCM transformation is a simple, explicit algorithm that creates large, smoothly joining bicubic Nurbs patches from a refined Catmull-Clark subdivision...
Jörg Peters
DANTE
1999
IEEE
119views Database» more  DANTE 1999»
15 years 11 months ago
A Semantic Caching Method Based on Linear Constraints
Because performance is a crucial issue in database systems, data caching techniques have been studied in database research field, especially in client-server databases and distrib...
Yoshiharu Ishikawa, Hiroyuki Kitagawa
ICRA
1999
IEEE
106views Robotics» more  ICRA 1999»
15 years 11 months ago
Haptic Exploration of Fine Surface Features
In this paper we consider the detection of small surface features, such as ridges and bumps, on the surface of an object during dextrous manipulation. First we review the represen...
Allison M. Okamura, Mark R. Cutkosky
IPPS
1999
IEEE
15 years 11 months ago
Sparse Matrix Block-Cyclic Redistribution
Run-time support for the CYCLIC(k) redistribution on the SPMD computation model is presently very relevant for the scientific community. This work is focused to the characterizati...
Gerardo Bandera, Emilio L. Zapata
GD
1999
Springer
15 years 11 months ago
Planarity-Preserving Clustering and Embedding for Large Planar Graphs
In this paper we present a novel approach for cluster-based drawing of large planar graphs that maintains planarity. Our technique works for arbitrary planar graphs and produces a ...
Christian A. Duncan, Michael T. Goodrich, Stephen ...
« Prev « First page 1053 / 1389 Last » Next »