Sciweavers

2478 search results - page 168 / 496
» Universality in two dimensions
Sort
View
ASIAMS
2007
IEEE
16 years 25 days ago
Rough-Fuzzy Granulation, Rough Entropy and Image Segmentation
This talk has two parts explaining the significance of Rough sets in granular computing in terms of rough set rules and in uncertainty handling in terms of lower and upper approxi...
Sankar K. Pal
SIGUCCS
2003
ACM
15 years 11 months ago
Training program growth...: from flat line to pulsating
IT Training and Communications is a division of Information Technology Services (ITS), which provides computer application training for the faculty and staff at Saint Louis Univer...
Sue A. Moore
DIGITALCITIES
2003
Springer
15 years 11 months ago
Activities and Technologies in Digital City Kyoto
We have developed a digital city for Kyoto, the old capital and cultural center of Japan, as a social information infrastructure for urban everyday life including shopping, busines...
Toru Ishida
STOC
1991
ACM
84views Algorithms» more  STOC 1991»
15 years 10 months ago
Self-Testing/Correcting for Polynomials and for Approximate Functions
The study of self-testing/correcting programs was introduced in [8] in order to allow one to use program P to compute function f without trusting that P works correctly. A self-te...
Peter Gemmell, Richard J. Lipton, Ronitt Rubinfeld...
SODA
2008
ACM
110views Algorithms» more  SODA 2008»
15 years 8 months ago
Why simple hash functions work: exploiting the entropy in a data stream
Hashing is fundamental to many algorithms and data structures widely used in practice. For theoretical analysis of hashing, there have been two main approaches. First, one can ass...
Michael Mitzenmacher, Salil P. Vadhan