Sciweavers

3495 search results - page 647 / 699
» On the random satisfiable process
Sort
View
SIGSOFT
2004
ACM
15 years 5 months ago
Correlation exploitation in error ranking
Static program checking tools can find many serious bugs in software, but due to analysis limitations they also frequently emit false error reports. Such false positives can easi...
Ted Kremenek, Ken Ashcraft, Junfeng Yang, Dawson R...
SPAA
2004
ACM
15 years 5 months ago
Fighting against two adversaries: page migration in dynamic networks
Page migration is one of the fundamental subproblems in the framework of data management in networks. It occurs in a distributed network of processors sharing one indivisible memo...
Marcin Bienkowski, Miroslaw Korzeniowski, Friedhel...
IPSN
2004
Springer
15 years 5 months ago
Estimation from lossy sensor data: jump linear modeling and Kalman filtering
Due to constraints in cost, power, and communication, losses often arise in large sensor networks. The sensor can be modeled as an output of a linear stochastic system with random...
Alyson K. Fletcher, Sundeep Rangan, Vivek K. Goyal
MIR
2010
ACM
206views Multimedia» more  MIR 2010»
15 years 5 months ago
An investigation into the relationship between semantic and content based similarity using LIDC
There is considerable research in the field of content-based medical image retrieval; however, few of the current systems investigate the relationship between the radiologists’...
Robert Kim, Grace Dasovich, Runa Bhaumik, Richard ...
SIGMOD
2010
ACM
223views Database» more  SIGMOD 2010»
15 years 4 months ago
Finding maximal cliques in massive networks by H*-graph
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
James Cheng, Yiping Ke, Ada Wai-Chee Fu, Jeffrey X...