Sciweavers

484 search results - page 33 / 97
» Measuring the Quality of Approximated Clusterings
Sort
View
WADS
2007
Springer
145views Algorithms» more  WADS 2007»
15 years 8 months ago
Approximate Shortest Paths Guided by a Small Index
Distance oracles and graph spanners are excerpts of a graph that allow to compute approximate shortest paths. Here, we consider the situation where it is possible to access the ori...
Jörg Derungs, Riko Jacob, Peter Widmayer
VISUALIZATION
1999
IEEE
15 years 6 months ago
Construction of Vector Field Hierarchies
We present a method for the hierarchical representation of vector fields. Our approach is based on iterative refinement using clustering and principal component analysis. The inpu...
Bjørn Heckel, Gunther H. Weber, Bernd Haman...
107
Voted
ADHOC
2010
292views more  ADHOC 2010»
15 years 2 months ago
Sleep/wake scheduling for multi-hop sensor networks: Non-convexity and approximation algorithm
We investigate the problem of sleep/wake scheduling for low duty cycle sensor networks. Our work differs from prior work in that we explicitly consider the effect of synchronizati...
Yan Wu, Sonia Fahmy, Ness B. Shroff
ISMIS
2009
Springer
15 years 8 months ago
Fuzzy Clustering for Categorical Spaces
Abstract. A multi-relational clustering method is presented which can be applied to complex knowledge bases storing resources expressed in the standard Semantic Web languages. It a...
Nicola Fanizzi, Claudia d'Amato, Floriana Esposito
115
Voted
IPCCC
2006
IEEE
15 years 8 months ago
SHARP: a new real-time scheduling algorithm to improve security of parallel applications on heterogeneous clusters
This paper addresses the problem of improving quality of security for real-time parallel applications on heterogeneous clusters. We propose a new security- and heterogeneity-drive...
Tao Xie 0004, Xiao Qin, Mais Nijim