Sciweavers

1972 search results - page 261 / 395
» Testing Mobile and Distributed Systems: Method and Experimen...
Sort
View
JCST
2006
65views more  JCST 2006»
15 years 4 months ago
P-Tree Structures and Event Horizon: Efficient Event-Set Implementations
This paper describes efficient data structures, namely the Indexed P-tree, Block P-tree, and Indexed-Block P-tree (or IP-tree, BP-tree, and IBP-tree, respectively, for short), for...
Katerina Asdre, Stavros D. Nikolopoulos
SIGSOFT
2005
ACM
16 years 5 months ago
Arithmetic program paths
We present Arithmetic Program Paths, a novel, efficient way to compress program control-flow traces that reduces program bit traces to less than a fifth of their original size whi...
Manos Renieris, Shashank Ramaprasad, Steven P. Rei...
ICIC
2005
Springer
15 years 10 months ago
Sequential Stratified Sampling Belief Propagation for Multiple Targets Tracking
Rather than the difficulties of highly non-linear and non-Gaussian observation process and the state distribution in single target tracking, the presence of a large, varying number...
Jianru Xue, Nanning Zheng, Xiaopin Zhong
MM
2000
ACM
515views Multimedia» more  MM 2000»
15 years 8 months ago
Efficient use of local edge histogram descriptor
The purpose of this paper is to show how the edge histogram descriptor for MPEG-7 can be efficiently utilized for image matching. Since the edge histogram descriptor recommended f...
Dong Kwon Park, Yoon Seok Jeon, Chee Sun Won
AAAI
1996
15 years 5 months ago
Building Classifiers Using Bayesian Networks
Recent work in supervised learning has shown that a surprisingly simple Bayesian classifier with strong assumptions of independence among features, called naive Bayes, is competit...
Nir Friedman, Moisés Goldszmidt