Sciweavers

128 search results - page 17 / 26
» Partitioning a weighted partial order
Sort
View
ORL
1998
116views more  ORL 1998»
13 years 7 months ago
Heuristic solution of the multisource Weber problem as a p-median problem
Good heuristic solutions for large Multisource Weber problems can be obtained by solving related p-median problems in which potential locations of the facilities are users location...
Pierre Hansen, Nenad Mladenovic, Éric D. Ta...
ICDM
2010
IEEE
230views Data Mining» more  ICDM 2010»
13 years 5 months ago
Clustering Large Attributed Graphs: An Efficient Incremental Approach
In recent years, many networks have become available for analysis, including social networks, sensor networks, biological networks, etc. Graph clustering has shown its effectivenes...
Yang Zhou, Hong Cheng, Jeffrey Xu Yu
ECCV
1998
Springer
14 years 9 months ago
Matching Hierarchical Structures Using Association Graphs
?It is well-known that the problem of matching two relational structures can be posed as an equivalent problem of finding a maximal clique in a (derived) ?association graph.? Howev...
Marcello Pelillo, Kaleem Siddiqi, Steven W. Zucker
OTM
2005
Springer
14 years 25 days ago
Web Image Semantic Clustering
This paper provides a novel Web image clustering methodology based on their associated texts. In our approach, the semantics of Web images are firstly represented into vectors of t...
Zhiguo Gong, Leong Hou U, Chan Wa Cheang
SIGMOD
2007
ACM
232views Database» more  SIGMOD 2007»
14 years 7 months ago
BLINKS: ranked keyword searches on graphs
Query processing over graph-structured data is enjoying a growing number of applications. Keyword search on a graph finds a set of answers, each of which is a substructure of the ...
Haixun Wang, Hao He, Jun Yang 0001, Philip S. Yu