5523 search results - page 294 / 1105 » Improving application performance with hardware data structu... |
139
Voted
KDD
2007
ACM
16 years 5 months ago
2007
ACM
Network clustering (or graph partitioning) is an important task for the discovery of underlying structures in networks. Many algorithms find clusters by maximizing the number of i...
124
Voted
ECCV
2010
Springer
15 years 9 months ago
2010
Springer
Many segmentation algorithms describe images in terms of a hierarchy of regions. Although such hierarchies can produce state of the art segmentations and have many applications, th...
135
click to vote
DEXA
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Fine-grained lock protocols should allow for highly concurrent transaction processing on XML document trees, which is addressed by the taDOM lock protocol family enabling...
153
Voted
SDM
2008
SIAM
15 years 6 months ago
2008
SIAM
In this paper we present the Dynamic Grow-Shrink Inference-based Markov network learning algorithm (abbreviated DGSIMN), which improves on GSIMN, the state-ofthe-art algorithm for...
130
click to vote
ICANN
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Classification of structured data (i.e., data that are represented as graphs) is a topic of interest in the machine learning community. This paper presents a different,...