Sciweavers

2969 search results - page 22 / 594
» A space efficient algorithm for group structure computation
Sort
View
PODS
2006
ACM
217views Database» more  PODS 2006»
16 years 6 months ago
A simpler and more efficient deterministic scheme for finding frequent items over sliding windows
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
Lap-Kei Lee, H. F. Ting
SIROCCO
2000
15 years 7 months ago
Cooperative computing with fragmentable and mergeable groups
ABSTRACT: This work considers the problem of performing a set of N tasks on a set of P cooperating message-passing processors (P N). The processors use a group communication servi...
Chryssis Georgiou, Alexander A. Shvartsman
294
Voted
ICDE
2002
IEEE
206views Database» more  ICDE 2002»
16 years 7 months ago
Exploiting Local Similarity for Indexing Paths in Graph-Structured Data
XML and other semi-structured data may have partially specified or missing schema information, motivating the use of a structural summary which can be automatically computed from ...
Raghav Kaushik, Pradeep Shenoy, Philip Bohannon, E...
ASIACRYPT
2001
Springer
15 years 9 months ago
An Efficient Implementation of Braid Groups
We implement various computations in the braid groups via practically efficient and theoretically optimized algorithms whose pseudo-codes are provided. The performance of an actual...
Jae Choon Cha, Ki Hyoung Ko, Sangjin Lee, Jae Woo ...
LCN
2006
IEEE
15 years 12 months ago
Efficient Algorithms for Secure Multicast key Management
Group Multicast is becoming a prevalent issue in Network applications such as teleconferencing, payper-view, and information services. In order to secure group communications by p...
Elham Khabiri, Saïd Bettayeb