Sciweavers

1013 search results - page 152 / 203
» Comparisons Between Data Clustering Algorithms
Sort
View
MMNS
2003
119views Multimedia» more  MMNS 2003»
13 years 10 months ago
A New Available Bandwidth Measurement Technique for Service Overlay Networks
Abstract. We introduce a new measurement algorithm for the available bandwidth in a network path between two endhosts. This algorithm is an adaptation from existing active measurem...
Cao Le Thanh Man, Go Hasegawa, Masayuki Murata
WWW
2004
ACM
14 years 10 months ago
Similarity spreading: a unified framework for similarity calculation of interrelated objects
In many Web search applications, similarities between objects of one type (say, queries) can be affected by the similarities between their interrelated objects of another type (sa...
Gui-Rong Xue, Hua-Jun Zeng, Zheng Chen, Wei-Ying M...
INFORMATICALT
2011
170views more  INFORMATICALT 2011»
13 years 4 months ago
Community Detection Through Optimal Density Contrast of Adjacency Matrix
Detecting communities in real world networks is an important problem for data analysis in science and engineering. By clustering nodes intelligently, a recursive algorithm is desig...
Tianzhu Liang, Kwok Yip Szeto
SIGMOD
2002
ACM
129views Database» more  SIGMOD 2002»
14 years 9 months ago
Dwarf: shrinking the PetaCube
Dwarf is a highly compressed structure for computing, storing, and querying data cubes. Dwarf identifies prefix and suffix structural redundancies and factors them out by coalesci...
Yannis Sismanis, Antonios Deligiannakis, Nick Rous...
INFOVIS
2005
IEEE
14 years 2 months ago
Flow Map Layout
Cartographers have long used flow maps to show the movement of objects from one location to another, such as the number of people in a migration, the amount of goods being traded,...
Doantam Phan, Ling Xiao, Ron B. Yeh, Pat Hanrahan,...