Sciweavers

16404 search results - page 125 / 3281
» A set coverage problem
Sort
View
JSAC
2006
128views more  JSAC 2006»
15 years 3 months ago
A framework for misuse detection in ad hoc networks- part II
We focus on detecting intrusions in ad hoc networks using the misuse detection technique. We allow for detection modules that periodically stop functioning due to operational failu...
D. Subhadrabandhu, S. Sarkar, F. Anjum
CORR
2010
Springer
107views Education» more  CORR 2010»
15 years 1 months ago
Maximum Betweenness Centrality: Approximability and Tractable Cases
The Maximum Betweenness Centrality problem (MBC) can be defined as follows. Given a graph find a k-element node set C that maximizes the probability of detecting communication be...
Martin Fink, Joachim Spoerhase
115
Voted
PASTE
2010
ACM
15 years 1 months ago
Property-aware program sampling
Monitoring or profiling programs provides us with an understanding for its further improvement and analysis. Typically, for monitoring or profiling, the program is instrumented ...
Harish Narayanappa, Mukul S. Bansal, Hridesh Rajan
144
Voted
SPIRE
2010
Springer
15 years 1 months ago
Identifying SNPs without a Reference Genome by Comparing Raw Reads
Next generation sequencing (NGS) technologies are being applied to many fields of biology, notably to survey the polymorphism across individuals of a species. However, while single...
Pierre Peterlongo, Nicolas Schnel, Nadia Pisanti, ...
ICST
2011
IEEE
14 years 7 months ago
It is Not the Length That Matters, It is How You Control It
—The length of test cases is a little investigated topic in search-based test generation for object oriented software, where test cases are sequences of method calls. While intui...
Gordon Fraser, Andrea Arcuri