Sciweavers

6045 search results - page 904 / 1209
» Computable Linearizations of Well-partial-orderings
Sort
View
224
Voted
ICPP
2000
IEEE
15 years 11 months ago
A Scalable Parallel Subspace Clustering Algorithm for Massive Data Sets
Clustering is a data mining problem which finds dense regions in a sparse multi-dimensional data set. The attribute values and ranges of these regions characterize the clusters. ...
Harsha S. Nagesh, Sanjay Goil, Alok N. Choudhary
SIGGRAPH
1999
ACM
15 years 11 months ago
LCIS: A Boundary Hierarchy for Detail-Preserving Contrast Reduction
High contrast scenes are difficult to depict on low contrast displays without loss of important fine details and textures. Skilled artists preserve these details by drawing scen...
Jack Tumblin, Greg Turk
IMR
1999
Springer
15 years 11 months ago
Mesh Association: Formulation and Algorithms
In computational simulation of coupled, multicomponent systems, it is frequently necessary to transfer data between meshes that may di er in resolution, structure, and discretizat...
Xiangmin Jiao, Herbert Edelsbrunner, Michael T. He...
CHI
1998
ACM
15 years 11 months ago
When the Interface is a Talking Dinosaur: Learning Across Media with ActiMates Barney
ActiMates™ Barney™ represents a new form of interactive learning product for two- to five-year old children: a small computer that looks like an animated plush doll. He can be...
Erik Strommen
CVPR
1997
IEEE
15 years 11 months ago
Model-based brightness constraints: on direct estimation of structure and motion
ÐWe describe a new direct method for estimating structure and motion from image intensities of multiple views. We extend the direct methods of Horn and Weldon [18] to three views....
Gideon P. Stein, Amnon Shashua