Sciweavers

2498 search results - page 164 / 500
» Data Structures with Unpredictable Timing
Sort
View
INFOVIS
2002
IEEE
15 years 3 months ago
A Hybrid Layout Algorithm for Sub-Quadratic Multidimensional Scaling
Many clustering and layout techniques have been used for structuring and visualising complex data. This paper is inspired by a number of such contemporary techniques and presents ...
Alistair Morrison, Greg Ross, Matthew Chalmers
TALG
2008
127views more  TALG 2008»
14 years 10 months ago
Fully dynamic algorithms for chordal graphs and split graphs
We present the rst dynamic algorithm that maintains a clique tree representation of a chordal graph and supports the following operations: (1) query whether deleting or inserting ...
Louis Ibarra
ICDE
2006
IEEE
149views Database» more  ICDE 2006»
15 years 11 months ago
An Efficient XPath Query Processor for XML Streams
Streaming XPath evaluation algorithms must record a potentially exponential number of pattern matches when both predicates and descendant axes are present in queries, and the XML ...
Yi Chen, Susan B. Davidson, Yifeng Zheng
WWW
2007
ACM
15 years 10 months ago
Mining contiguous sequential patterns from web logs
Finding Contiguous Sequential Patterns (CSP) is an important problem in Web usage mining. In this paper we propose a new data structure, UpDown Tree, for CSP mining. An UpDown Tre...
Jinlin Chen, Terry Cook
EDBT
2006
ACM
124views Database» more  EDBT 2006»
15 years 10 months ago
Supporting Temporal Slicing in XML Databases
Nowadays XML is universally accepted as the standard for structural data representation; XML databases, providing structural querying support, are thus becoming more and more popul...
Federica Mandreoli, Riccardo Martoglia, Enrico Ron...