Sciweavers

91 search results - page 17 / 19
» The Data Stream Space Complexity of Cascaded Norms
Sort
View
JDCTA
2010
228views more  JDCTA 2010»
13 years 3 months ago
Research and Progress of Cluster Algorithms based on Granular Computing
Granular Computing (GrC), a knowledge-oriented computing which covers the theory of fuzzy information granularity, rough set theory, the theory of quotient space and interval comp...
Shifei Ding, Li Xu, Hong Zhu, Liwen Zhang
ICDE
1999
IEEE
106views Database» more  ICDE 1999»
14 years 10 months ago
Processing Operations with Restrictions in RDBMS without External Sorting: The Tetris Algorithm
Most operations of the relational algebra or SQL require a sorted stream of tuples for efficient processing. Therefore, processing complex relational queries relies on efficient a...
Volker Markl, Martin Zirkel, Rudolf Bayer
HIPC
2009
Springer
13 years 6 months ago
Highly scalable algorithm for distributed real-time text indexing
Stream computing research is moving from terascale to petascale levels. It aims to rapidly analyze data as it streams in from many sources and make decisions with high speed and a...
Ankur Narang, Vikas Agarwal, Monu Kedia, Vijay K. ...
3DPVT
2002
IEEE
169views Visualization» more  3DPVT 2002»
14 years 1 months ago
Compression of Isosurfaces for Structured Volumes with Context Modelling
In many applications surfaces with a large number of primitives occur. Geometry compression reduces storage space and transmission time for such models. A special case is given by...
Dietmar Saupe, Jens-Peer Kuska
CORR
2010
Springer
112views Education» more  CORR 2010»
13 years 8 months ago
On Finding Frequent Patterns in Event Sequences
Given a directed acyclic graph with labeled vertices, we consider the problem of finding the most common label sequences ("traces") among all paths in the graph (of some...
Andrea Campagna, Rasmus Pagh