Sciweavers

1430 search results - page 92 / 286
» Representing Probability Measures using Probabilistic Proces...
Sort
View
CJ
2002
67views more  CJ 2002»
13 years 9 months ago
Using Bloom Filters to Speed-up Name Lookup in Distributed Systems
Bloom filters make use of a "probabilistic" hash-coding method to reduce the amount of space required to store a hash set. A Bloom filter offers a trade-off between its ...
Mark C. Little, Santosh K. Shrivastava, Neil A. Sp...
IMC
2003
ACM
14 years 2 months 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
ICIP
2001
IEEE
14 years 10 months ago
Similarity measure for CCITT Group 4 compressed document images
Similarity measure of document images acts a crucial role in the area of document image retrieval. A method of measuring the similarity of CCITT Group 4 compressed document images...
Yue Lu, Chew Lim Tan, Liying Fan, Weihua Huang
IANDC
2006
103views more  IANDC 2006»
13 years 9 months ago
Bisimulation and cocongruence for probabilistic systems
We introduce a new notion of bisimulation, called event bisimulation on labelled Markov processes (LMPs) and compare it with the, now standard, notion of probabilistic bisimulatio...
Vincent Danos, Josee Desharnais, François L...
ICIP
2008
IEEE
14 years 10 months ago
Motion detection with false discovery rate control
Visual surveillance applications such as object identification, object tracking, and anomaly detection require reliable motion detection as an initial processing step. Such a dete...
David A. Castañon, J. Mike McHugh, Janusz K...