Sciweavers

6358 search results - page 160 / 1272
» Computing spectral sequences
Sort
View
CVPR
2006
IEEE
16 years 8 months ago
Unsupervised Learning of Categories from Sets of Partially Matching Image Features
We present a method to automatically learn object categories from unlabeled images. Each image is represented by an unordered set of local features, and all sets are embedded into...
Kristen Grauman, Trevor Darrell
IWNAS
2008
IEEE
16 years 26 days ago
A Novel Embedded Accelerator for Online Detection of Shrew DDoS Attacks
∗ As one type of stealthy and hard-to-detect attack, lowrate TCP-targeted DDoS attack can seriously throttle the throughput of normal TCP flows for a long time without being noti...
Hao Chen, Yu Chen
DIS
2006
Springer
15 years 10 months ago
Clustering Pairwise Distances with Missing Data: Maximum Cuts Versus Normalized Cuts
Abstract. Clustering algorithms based on a matrix of pairwise similarities (kernel matrix) for the data are widely known and used, a particularly popular class being spectral clust...
Jan Poland, Thomas Zeugmann
BMCBI
2006
141views more  BMCBI 2006»
15 years 6 months ago
Asymptotic behaviour and optimal word size for exact and approximate word matches between random sequences
Background: The number of k-words shared between two sequences is a simple and effcient alignment-free sequence comparison method. This statistic, D2, has been used for the cluste...
Sylvain Forêt, Miriam R. Kantorovitz, Conrad...
PODC
2006
ACM
16 years 13 days ago
Computing separable functions via gossip
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...
Damon Mosk-Aoyama, Devavrat Shah