Sciweavers

4007 search results - page 424 / 802
» Computation with imprecise probabilities
Sort
View
ICPR
2000
IEEE
15 years 11 months ago
Statistical-Based Approach to Word Segmentation
Thispaper presents a text word extraction algorithm that takes a set of bounding boxes of glyphs and their associated text lines of a given document andpartitions the glyphs into ...
Yalin Wang, Robert M. Haralick, Ihsin T. Phillips
STOC
2000
ACM
112views Algorithms» more  STOC 2000»
15 years 11 months ago
A random graph model for massive graphs
We propose a random graph model which is a special case of sparse random graphs with given degree sequences. This model involves only a small number of parameters, called logsize ...
William Aiello, Fan R. K. Chung, Linyuan Lu
ASIACRYPT
2000
Springer
15 years 11 months ago
Attack for Flash MIX
A MIX net takes a list of ciphertexts (c1, · · · , cN ) and outputs a permuted list of the plaintexts (m1, · · · , mN ) without revealing the relationship between (c1, · · ...
Masashi Mitomo, Kaoru Kurosawa
DAWAK
1999
Springer
15 years 11 months ago
OLAP-based Scalable Profiling of Customer Behavior
Profiling customers’ behavior has become increasingly important for many applications such as fraud detection, targeted marketing and promotion. Customer behavior profiles are cr...
Qiming Chen, Umeshwar Dayal, Meichun Hsu
QCQC
1998
Springer
115views Communications» more  QCQC 1998»
15 years 11 months ago
Quantum Entanglement and the Communication Complexity of the Inner Product Function
Abstract. We consider the communication complexity of the binary inner product function in a variation of the two-party scenario where the parties have an a priori supply of partic...
Richard Cleve, Wim van Dam, Michael Nielsen, Alain...