Sciweavers

2593 search results - page 288 / 519
» Algorithms and Data Structures for Computer Topology
Sort
View
SIGMOD
2002
ACM
127views Database» more  SIGMOD 2002»
16 years 7 months ago
Approximate XML joins
XML is widely recognized as the data interchange standard for tomorrow, because of its ability to represent data from a wide variety of sources. Hence, XML is likely to be the for...
Sudipto Guha, H. V. Jagadish, Nick Koudas, Divesh ...
PPOPP
2011
ACM
14 years 10 months ago
Wait-free queues with multiple enqueuers and dequeuers
The queue data structure is fundamental and ubiquitous. Lockfree versions of the queue are well known. However, an important open question is whether practical wait-free queues ex...
Alex Kogan, Erez Petrank
ACMSE
2009
ACM
16 years 1 months ago
A hybrid approach to mining frequent sequential patterns
The mining of frequent sequential patterns has been a hot and well studied area—under the broad umbrella of research known as KDD (Knowledge Discovery and Data Mining)— for we...
Erich Allen Peterson, Peiyi Tang
IEEESCC
2008
IEEE
16 years 1 months ago
Exploiting XML Schema for Interpreting XML Documents as RDF
Interpreting legacy XML documents is a great challenge for realizing the vision of the Semantic Web (SW). This paper presents an algorithm to transform XML data into RDF- foundati...
Pham Thi Thu Thuy, Young-Koo Lee, Sungyoung Lee, B...
TAMC
2009
Springer
16 years 1 months ago
The Extended Turing Model as Contextual Tool
Computability concerns information with a causal – typically algorithmic – structure. As such, it provides a schematic analysis of many naturally occurring situations. We look ...
S. Barry Cooper