Sciweavers

5414 search results - page 328 / 1083
» Data representation synthesis
Sort
View
156
Voted
VIS
2003
IEEE
121views Visualization» more  VIS 2003»
16 years 8 months ago
Hierarchical Clustering for Unstructured Volumetric Scalar Fields
We present a method to represent unstructured scalar fields at multiple levels of detail. Using a parallelizable classification algorithm to build a cluster hierarchy, we generate...
Christopher S. Co, Bjørn Heckel, Hans Hagen...
KDD
2008
ACM
199views Data Mining» more  KDD 2008»
16 years 7 months ago
Building semantic kernels for text classification using wikipedia
Document classification presents difficult challenges due to the sparsity and the high dimensionality of text data, and to the complex semantics of the natural language. The tradi...
Pu Wang, Carlotta Domeniconi
203
Voted
IPSN
2007
Springer
16 years 1 months ago
Approximate isocontours and spatial summaries for sensor networks
We consider the problem of approximating a family of isocontours in a sensor field with a topologically-equivalent family of simple polygons. Our algorithm is simple and distribu...
Sorabh Gandhi, John Hershberger, Subhash Suri
SIGGRAPH
1999
ACM
15 years 11 months ago
Creating Generative Models from Range Images
We describe a new approach for creating concise high-level generative models from range images or other approximate representations of real objects. Using data from a variety of a...
Ravi Ramamoorthi, James Arvo
178
Voted
KDD
2010
ACM
223views Data Mining» more  KDD 2010»
15 years 11 months ago
Frequent regular itemset mining
Concise representations of frequent itemsets sacrifice readability and direct interpretability by a data analyst of the concise patterns extracted. In this paper, we introduce an...
Salvatore Ruggieri