Sciweavers

581 search results - page 30 / 117
» Fast Hierarchical Clustering Based on Compressed Data
Sort
View
IJCM
2007
205views more  IJCM 2007»
13 years 10 months ago
BTF modelling using BRDF texels
The highest fidelity representations of realistic real-world materials currently used comprise Bidirectional Texture Functions (BTF). The BTF is a six dimensional function dependi...
Jirí Filip, Michal Haindl
TVCG
2008
136views more  TVCG 2008»
13 years 10 months ago
Hierarchical Tensor Approximation of Multi-Dimensional Visual Data
Abstract-- Visual data comprise of multi-scale and inhomogeneous signals. In this paper, we exploit these characteristics and develop a compact data representation technique based ...
Qing Wu, Tian Xia, Chun Chen, Hsueh-Yi Sean Lin, H...
ICML
2009
IEEE
14 years 4 months ago
Fast evolutionary maximum margin clustering
The maximum margin clustering approach is a recently proposed extension of the concept of support vector machines to the clustering problem. Briefly stated, it aims at finding a...
Fabian Gieseke, Tapio Pahikkala, Oliver Kramer
ICDE
2010
IEEE
288views Database» more  ICDE 2010»
14 years 10 months ago
Fast In-Memory XPath Search using Compressed Indexes
A large fraction of an XML document typically consists of text data. The XPath query language allows text search via the equal, contains, and starts-with predicates. Such predicate...
Diego Arroyuelo, Francisco Claude, Sebastian Manet...
SEBD
2004
139views Database» more  SEBD 2004»
13 years 11 months ago
A New Histogram-based Technique for Compressing Multi-Dimensional Data
Abstract. The need to compress data into synopses of summarized information often arises in many application scenarios, where the aim is to retrieve aggregate data efficiently, pos...
Filippo Furfaro, Giuseppe M. Mazzeo, Domenico Sacc...