2314 search results - page 399 / 463 » Minimal Partitions of a Graph |
153
click to vote
ICML
2004
IEEE
16 years 4 months ago
2004
IEEE
The performance of graph based clustering methods critically depends on the quality of the distance function, used to compute similarities between pairs of neighboring nodes. In t...
134
Voted
KDD
2008
ACM
16 years 3 months ago
2008
ACM
Frequent patterns provide solutions to datasets that do not have well-structured feature vectors. However, frequent pattern mining is non-trivial since the number of unique patter...
134
click to vote
WINE
2009
Springer
15 years 10 months ago
2009
Springer
We study the geometrical shape of the partitions of the input space created by the allocation rule of a truthful mechanism for multi-unit auctions with multidimensional types and ...
134
click to vote
IWMM
2009
Springer
15 years 10 months ago
2009
Springer
Tracing algorithms visit reachable nodes in a graph and are central to activities such as garbage collection, marshalling etc. Traditional sequential algorithms use a worklist, re...
160
Voted
VISUALIZATION
2005
IEEE
15 years 9 months ago
2005
IEEE
The Multi Triangulation framework (MT) is a very general approach for managing adaptive resolution in triangle meshes. The key idea is arranging mesh fragments at different resolu...