2600 search results - page 278 / 520 » Clustering with or without the Approximation |
208
click to vote
ICDCS
2011
IEEE
14 years 5 months ago
2011
IEEE
Abstract—Jamming attacks and unintentional radio interference are one of the most urgent threats harming the dependability of wireless communication and endangering the successfu...
182
click to vote
KDD
2008
ACM
16 years 6 months ago
2008
ACM
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...
177
click to vote
KDD
2008
ACM
16 years 6 months ago
2008
ACM
A hypergraph is a generalization of the traditional graph in which the edges are arbitrary non-empty subsets of the vertex set. It has been applied successfully to capture highord...
170
click to vote
STOC
2006
ACM
16 years 6 months ago
2006
ACM
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs s1t1, s2t2, . . ., sktk, the goal is to maximize the number of pairs t...
199
click to vote
SIGECOM
2010
ACM
15 years 11 months ago
2010
ACM
The existing literature on optimal auctions focuses on optimizing the expected revenue of the seller, and is appropriate for risk-neutral sellers. In this paper, we identify good ...