Sciweavers

312 search results - page 50 / 63
» An experimental study on algorithms for drawing binary trees
Sort
View
CODES
2011
IEEE
12 years 7 months ago
Analysis and optimization of fault-tolerant task scheduling on multiprocessor embedded systems
Reliability is a major requirement for most safety-related systems. To meet this requirement, fault-tolerant techniques such as hardware replication and software re-execution are ...
Jia Huang, Jan Olaf Blech, Andreas Raabe, Christia...
CP
2001
Springer
14 years 3 days ago
Random 3-SAT and BDDs: The Plot Thickens Further
Abstract. This paper contains an experimental study of the impact of the construction strategy of reduced, ordered binary decision diagrams (ROBDDs) on the average-case computation...
Alfonso San Miguel Aguirre, Moshe Y. Vardi
SIGMOD
2009
ACM
180views Database» more  SIGMOD 2009»
14 years 7 months ago
Indexing correlated probabilistic databases
With large amounts of correlated probabilistic data being generated in a wide range of application domains including sensor networks, information extraction, event detection etc.,...
Bhargav Kanagal, Amol Deshpande
CIKM
2009
Springer
14 years 2 months ago
P-Rank: a comprehensive structural similarity measure over information networks
With the ubiquity of information networks and their broad applications, the issue of similarity computation between entities of an information network arises and draws extensive r...
Peixiang Zhao, Jiawei Han, Yizhou Sun
DIS
2006
Springer
13 years 9 months ago
Change Detection with Kalman Filter and CUSUM
Knowledge discovery systems are constrained by three main limited resources: time, memory and sample size. Sample size is traditionally the dominant limitation, but in many present...
Milton Severo, João Gama