Sciweavers

3422 search results - page 456 / 685
» Random Subset Optimization
Sort
View
106
Voted
SODA
2010
ACM
169views Algorithms» more  SODA 2010»
16 years 1 months ago
Efficiently Decodable Non-adaptive Group Testing
We consider the following "efficiently decodable" nonadaptive group testing problem. There is an unknown string x {0, 1}n with at most d ones in it. We are allowed to t...
Piotr Indyk, Hung Q. Ngo, Atri Rudra
155
Voted
EDBT
2010
ACM
246views Database» more  EDBT 2010»
15 years 10 months ago
Fast computation of SimRank for static and dynamic information networks
Information networks are ubiquitous in many applications and analysis on such networks has attracted significant attention in the academic communities. One of the most important ...
Cuiping Li, Jiawei Han, Guoming He, Xin Jin, Yizho...
107
Voted
KDD
2009
ACM
167views Data Mining» more  KDD 2009»
15 years 10 months ago
Anomalous window discovery through scan statistics for linear intersecting paths (SSLIP)
Anomalous windows are the contiguous groupings of data points. In this paper, we propose an approach for discovering anomalous windows using Scan Statistics for Linear Intersectin...
Lei Shi, Vandana Pursnani Janeja
129
Voted
INFOCOM
2009
IEEE
15 years 10 months ago
Fair Routing in Delay Tolerant Networks
—The typical state-of-the-art routing algorithms for delay tolerant networks are based on best next hop hill-climbing heuristics in order to achieve throughput and efficiency. T...
Josep M. Pujol, Alberto Lopez Toledo, Pablo Rodrig...
128
Voted
NOSSDAV
2009
Springer
15 years 10 months ago
Overlay monitoring and repair in swarm-based peer-to-peer streaming
In Swarm-based Peer-to-Peer Streaming (SPS) mechanisms, participating peers form a randomly connected mesh over which they incorporate swarm-like content delivery. In practice, a ...
Nazanin Magharei, Reza Rejaie