Sciweavers

686 search results - page 123 / 138
» On the General Applicability of Instruction-Set Randomizatio...
Sort
View
SODA
2010
ACM
169views Algorithms» more  SODA 2010»
14 years 6 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
SOSP
2003
ACM
14 years 5 months ago
Performance debugging for distributed systems of black boxes
Many interesting large-scale systems are distributed systems of multiple communicating components. Such systems can be very hard to debug, especially when they exhibit poor perfor...
Marcos Kawazoe Aguilera, Jeffrey C. Mogul, Janet L...
MSWIM
2009
ACM
14 years 3 months ago
Designing an asynchronous group communication middleware for wireless users
We evaluate an asynchronous gossiping middleware for wireless users that propagates messages from any group member to all the other group members. This propagation can either be i...
Xuwen Yu, Surendar Chandra
KDD
2009
ACM
167views Data Mining» more  KDD 2009»
14 years 3 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
SISAP
2009
IEEE
149views Data Mining» more  SISAP 2009»
14 years 3 months ago
Combinatorial Framework for Similarity Search
—We present an overview of the combinatorial framework for similarity search. An algorithm is combinatorial if only direct comparisons between two pairwise similarity values are ...
Yury Lifshits