Sciweavers

1285 search results - page 140 / 257
» On the Complexity of Ordinal Clustering
Sort
View
TNN
2010
216views Management» more  TNN 2010»
13 years 4 months ago
Simplifying mixture models through function approximation
Finite mixture model is a powerful tool in many statistical learning problems. In this paper, we propose a general, structure-preserving approach to reduce its model complexity, w...
Kai Zhang, James T. Kwok
INFOCOM
2012
IEEE
12 years 20 days ago
Threshold compression for 3G scalable monitoring
—We study the problem of scalable monitoring of operational 3G wireless networks. Threshold-based performance monitoring in large 3G networks is very challenging for two main fac...
Suk-Bok Lee, Dan Pei, MohammadTaghi Hajiaghayi, Io...
IM
2008
13 years 10 months ago
Directed Random Dot Product Graphs
In this paper we consider three models for random graphs that utilize the inner product as their fundamental object. We analyze the behavior of these models with respect to cluster...
Stephen J. Young, Edward R. Scheinerman
BTW
1993
Springer
193views Database» more  BTW 1993»
14 years 2 months ago
Query Optimization in an OODBMS
It is clearly crucial for the success of object-oriented databases to find effiĆ cient implementations that improve on the performance of relational sysĆ tems, rather than being...
Christian Rich, Marc H. Scholl
WAW
2004
Springer
178views Algorithms» more  WAW 2004»
14 years 3 months ago
Communities Detection in Large Networks
We develop an algorithm to detect community structure in complex networks. The algorithm is based on spectral methods and takes into account weights and links orientations. Since t...
Andrea Capocci, Vito Domenico Pietro Servedio, Gui...