Sciweavers

903 search results - page 34 / 181
» Using Library Dependencies for Clustering
Sort
View
CLASSIFICATION
2008
73views more  CLASSIFICATION 2008»
13 years 8 months ago
Solving Non-Uniqueness in Agglomerative Hierarchical Clustering Using Multidendrograms
: In agglomerative hierarchical clustering, pair-group methods suffer from a problem of non-uniqueness when two or more distances between different clusters coincide during the ama...
Alberto Fernández, Sergio Gómez
IJCM
2007
205views more  IJCM 2007»
13 years 8 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
ALENEX
2008
142views Algorithms» more  ALENEX 2008»
13 years 9 months ago
Consensus Clustering Algorithms: Comparison and Refinement
Consensus clustering is the problem of reconciling clustering information about the same data set coming from different sources or from different runs of the same algorithm. Cast ...
Andrey Goder, Vladimir Filkov
LPAR
2001
Springer
14 years 14 days ago
Boolean Functions for Finite-Tree Dependencies
Several logic-based languages, such as Prolog II and its successors, SICStus Prolog and Oz, offer a computation domain including rational trees. Infinite rational trees allow fo...
Roberto Bagnara, Enea Zaffanella, Roberta Gori, Pa...
VTC
2010
IEEE
195views Communications» more  VTC 2010»
13 years 5 months ago
Efficiency of Distributed Compression and Its Dependence on Sensor Node Deployments
Abstract--In this paper we analyze the energy-efficiency of distributed compression and its dependence on the node deployment strategies for Wireless Sensor Networks (WSNs). Reduce...
Frank Oldewurtel, Janne Riihijärvi, Petri M&a...