Sciweavers

474 search results - page 70 / 95
» Approximation Algorithms for Tensor Clustering
Sort
View
ISAAC
2010
Springer
226views Algorithms» more  ISAAC 2010»
13 years 5 months ago
On Tractable Cases of Target Set Selection
We study the NP-complete TARGET SET SELECTION (TSS) problem occurring in social network analysis. Complementing results on its approximability and extending results for its restric...
André Nichterlein, Rolf Niedermeier, Johann...
IMR
2004
Springer
14 years 1 months ago
Smoothing and Adaptive Redistribution for Grids with Irregular Valence and Hanging Nodes
We describe some extensions to the grid smoothing scheme described in [1, 2] that deal with the following issues: 1) the clustering effect of changing valence in an unstructured ...
Larisa Branets, Graham F. Carey
KDD
2008
ACM
115views Data Mining» more  KDD 2008»
14 years 8 months ago
SPIRAL: efficient and exact model identification for hidden Markov models
Hidden Markov models (HMMs) have received considerable attention in various communities (e.g, speech recognition, neurology and bioinformatic) since many applications that use HMM...
Yasuhiro Fujiwara, Yasushi Sakurai, Masashi Yamamu...
KDD
2006
ACM
156views Data Mining» more  KDD 2006»
14 years 8 months ago
Unsupervised learning on k-partite graphs
Various data mining applications involve data objects of multiple types that are related to each other, which can be naturally formulated as a k-partite graph. However, the resear...
Bo Long, Xiaoyun Wu, Zhongfei (Mark) Zhang, Philip...
ISCC
2006
IEEE
123views Communications» more  ISCC 2006»
14 years 1 months ago
Similarity Search in a Hybrid Overlay P2P Network
P2P systems are increasingly used to discover and share various data between users. The performance of a P2P based information retrieval system is determined by the efficiency of...
Mouna Kacimi, Kokou Yétongnon