113 search results - page 16 / 23 » When can a graph form an orthogonal polyhedron |
INFOCOM
2006
IEEE
14 years 1 months ago
2006
IEEE
—Wireless Community Networks (WCNs) are wide-area wireless networks whose nodes are owned and managed by volunteers. We focus on the provision of Internet access to mobile users ...
SPAA
2006
ACM
14 years 1 months ago
2006
ACM
Synchronization is often necessary in parallel computing, but it can create delays whenever the receiving processor is idle, waiting for the information to arrive. This is especia...
CVPR
2010
IEEE
14 years 3 months ago
2010
IEEE
When classifying high-dimensional sequence data, traditional methods (e.g., HMMs, CRFs) may require large amounts of training data to avoid overfitting. In such cases dimensional...
PRL
2007
13 years 6 months ago
2007
This paper proposes a novel nonparametric clustering algorithm capable of identifying shape-free clusters. This algorithm is based on a nonparametric estimation of the normalized ...
WAW
2004
Springer
14 years 21 days ago
2004
Springer
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...