Sciweavers

4722 search results - page 900 / 945
» Representation-independent program analysis
Sort
View
MOBIHOC
2005
ACM
14 years 7 months ago
Toward resilient security in wireless sensor networks
Node compromise poses severe security threats in wireless sensor networks. Unfortunately, existing security designs can address only a small, fixed threshold number of compromised...
Hao Yang, Fan Ye, Yuan Yuan, Songwu Lu, William A....
SODA
2010
ACM
189views Algorithms» more  SODA 2010»
14 years 5 months ago
Correlation Clustering with Noisy Input
Correlation clustering is a type of clustering that uses a basic form of input data: For every pair of data items, the input specifies whether they are similar (belonging to the s...
Claire Mathieu, Warren Schudy
SODA
2010
ACM
231views Algorithms» more  SODA 2010»
14 years 5 months ago
Asymmetric Traveling Salesman Path and Directed Latency Problems
We study integrality gaps and approximability of two closely related problems on directed graphs. Given a set V of n nodes in an underlying asymmetric metric and two specified nod...
Zachary Friggstad, Mohammad R. Salavatipour, Zoya ...
SDM
2009
SIAM
149views Data Mining» more  SDM 2009»
14 years 4 months ago
Near-optimal Supervised Feature Selection among Frequent Subgraphs.
Graph classification is an increasingly important step in numerous application domains, such as function prediction of molecules and proteins, computerised scene analysis, and an...
Alexander J. Smola, Arthur Gretton, Hans-Peter Kri...
EUROSYS
2010
ACM
14 years 4 months ago
Kivati: Fast Detection and Prevention of Atomicity Violations
Bugs in concurrent programs are extremely difficult to find and fix during testing. In this paper, we propose Kivati, which can efficiently detect and prevent atomicity violat...
Lee Chew, David Lie