Sciweavers

14779 search results - page 2884 / 2956
» On Ultrametric Algorithmic Information
Sort
View
FOCS
2000
IEEE
15 years 4 months ago
Opportunistic Data Structures with Applications
There is an upsurging interest in designing succinct data structures for basic searching problems (see [23] and references therein). The motivation has to be found in the exponent...
Paolo Ferragina, Giovanni Manzini
SIGGRAPH
2000
ACM
15 years 3 months ago
Computer modelling of fallen snow
In this paper, we present a new model of snow accumulation and stability for computergraphics. Our contribution is divided into two major components, each essential for modelling ...
Paul Fearing
SIGMOD
2000
ACM
129views Database» more  SIGMOD 2000»
15 years 3 months ago
Mining Frequent Patterns without Candidate Generation
Mining frequent patterns in transaction databases, time-series databases, and many other kinds of databases has been studied popularly in data mining research. Most of the previous...
Jiawei Han, Jian Pei, Yiwen Yin
CPM
2000
Springer
177views Combinatorics» more  CPM 2000»
15 years 3 months ago
Identifying and Filtering Near-Duplicate Documents
Abstract. The mathematical concept of document resemblance captures well the informal notion of syntactic similarity. The resemblance can be estimated using a fixed size “sketch...
Andrei Z. Broder
CRYPTO
2000
Springer
151views Cryptology» more  CRYPTO 2000»
15 years 3 months ago
New Public-Key Cryptosystem Using Braid Groups
Abstract. The braid groups are infinite non-commutative groups naturally arising from geometric braids. The aim of this article is twofold. One is to show that the braid groups ca...
Ki Hyoung Ko, Sangjin Lee, Jung Hee Cheon, Jae Woo...
« Prev « First page 2884 / 2956 Last » Next »