Sciweavers

1000 search results - page 198 / 200
» Nominal rewriting systems
Sort
View
SIGMOD
2007
ACM
225views Database» more  SIGMOD 2007»
14 years 6 months ago
From complete to incomplete information and back
Incomplete information arises naturally in numerous data management applications. Recently, several researchers have studied query processing in the context of incomplete informat...
Lyublena Antova, Christoph Koch, Dan Olteanu
STOC
2010
ACM
216views Algorithms» more  STOC 2010»
14 years 3 months ago
The HOM problem is decidable
We close affirmatively a question which has been open for long time: decidability of the HOM problem. The HOM problem consists in determining, given a tree homomorphism D and a re...
Guillem Godoy, Omer Giménez, Lander Ramos and Car...
VLDB
2007
ACM
94views Database» more  VLDB 2007»
14 years 9 days ago
iTrails: Pay-as-you-go Information Integration in Dataspaces
Dataspace management has been recently identified as a new agenda for information management [17, 22] and information integration [23]. In sharp contrast to standard information ...
Marcos Antonio Vaz Salles, Jens-Peter Dittrich, Sh...
ACSAC
2006
IEEE
14 years 8 days ago
Address Space Layout Permutation (ASLP): Towards Fine-Grained Randomization of Commodity Software
Address space randomization is an emerging and promising method for stopping a broad range of memory corruption attacks. By randomly shifting critical memory regions at process in...
Chongkyung Kil, Jinsuk Jun, Christopher Bookholt, ...
LACL
2005
Springer
13 years 11 months ago
A Note on the Complexity of Constraint Interaction: Locality Conditions and Minimalist Grammars
Locality Conditions (LCs) on (unbounded) dependencies have played a major role in the development of generative syntax ever since the seminal work by Ross [22]. Descriptively, they...
Hans-Martin Gärtner, Jens Michaelis