Sciweavers

127 search results - page 20 / 26
» Measuring the Hardness of SAT Instances
Sort
View
CIA
2006
Springer
13 years 11 months ago
Coverage Density as a Dominant Property of Large-Scale Sensor Networks
Large-scale sensor networks are becoming more present in our life then ever. Such an environment could be a cellular network, an array of fire detection sensors, an array of solar ...
Osher Yadgar, Sarit Kraus
WWW
2009
ACM
14 years 8 months ago
Latent space domain transfer between high dimensional overlapping distributions
Transferring knowledge from one domain to another is challenging due to a number of reasons. Since both conditional and marginal distribution of the training data and test data ar...
Sihong Xie, Wei Fan, Jing Peng, Olivier Verscheure...
IMC
2003
ACM
14 years 19 days ago
Bitmap algorithms for counting active flows on high speed links
—This paper presents a family of bitmap algorithms that address the problem of counting the number of distinct header patterns (flows) seen on a high-speed link. Such counting c...
Cristian Estan, George Varghese, Mike Fisk
RTSS
2008
IEEE
14 years 1 months ago
Hardware Runtime Monitoring for Dependable COTS-Based Real-Time Embedded Systems
COTS peripherals are heavily used in the embedded market, but their unpredictability is a threat for high-criticality real-time systems: it is hard or impossible to formally verif...
Rodolfo Pellizzoni, Patrick O'Neil Meredith, Marco...
MSR
2006
ACM
14 years 1 months ago
Detecting similar Java classes using tree algorithms
Similarity analysis of source code is helpful during development to provide, for instance, better support for code reuse. Consider a development environment that analyzes code whi...
Tobias Sager, Abraham Bernstein, Martin Pinzger, C...