Sciweavers

140 search results - page 27 / 28
» Practical Suffix Tree Construction
Sort
View
PLANX
2007
13 years 7 months ago
XML Transformation Language Based on Monadic Second Order Logic
Although monadic second-order logic (MSO) has been a foundation of XML queries, little work has attempted to take MSO formulae themselves as a programming construct. Indeed, MSO f...
Kazuhiro Inaba, Haruo Hosoya
KBSE
2009
IEEE
14 years 15 days ago
Static Validation of C Preprocessor Macros
—The widely used C preprocessor (CPP) is generally considered a source of difficulty for understanding and maintaining C/C++ programs. The main reason for this difficulty is CP...
Andreas Saebjoernsen, Lingxiao Jiang, Daniel J. Qu...
ALGORITHMICA
2002
103views more  ALGORITHMICA 2002»
13 years 5 months ago
Efficient Bulk Operations on Dynamic R-Trees
In recent years there has been an upsurge of interest in spatial databases. A major issue is how to manipulate efficiently massive amounts of spatial data stored on disk in multidi...
Lars Arge, Klaus Hinrichs, Jan Vahrenhold, Jeffrey...
ESORICS
2009
Springer
14 years 6 months ago
Enabling Public Verifiability and Data Dynamics for Storage Security in Cloud Computing
Cloud Computing has been envisioned as the next-generation architecture of IT Enterprise. It moves the application software and databases to the centralized large data centers, whe...
Qian Wang, Cong Wang, Jin Li, Kui Ren, Wenjing Lou
ICFP
2005
ACM
14 years 5 months ago
Monadic augment and generalised short cut fusion
Monads are commonplace programming devices that are used to uniformly structure computations with effects such as state, exceptions, and I/O. This paper further develops the monad...
Neil Ghani, Patricia Johann, Tarmo Uustalu, Varmo ...