Sciweavers

7434 search results - page 168 / 1487
» Still
Sort
View
145
Voted
ICALP
2009
Springer
16 years 4 months ago
The Ehrenfeucht-Silberger Problem
We consider repetitions in words and solve a longstanding open problem about the relation between the period and the length of its longest unbordered factor. A word u is called bor...
Stepan Holub, Dirk Nowotka
ICALP
2009
Springer
16 years 4 months ago
Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus
Ong has shown that the modal mu-calculus model checking problem (equivalently, the alternating parity tree automaton (APT) acceptance problem) of possibly-infinite ranked trees gen...
Naoki Kobayashi, C.-H. Luke Ong
204
Voted
SIGMOD
2009
ACM
143views Database» more  SIGMOD 2009»
16 years 4 months ago
Data integration in mashups
Mashup is a new application development approach that allows users to aggregate multiple services to create a service for a new purpose. Even if the Mashup approach opens new and ...
Giusy Di Lorenzo, Hakim Hacid, Hye-Young Paik, Bou...
SIGMOD
2006
ACM
96views Database» more  SIGMOD 2006»
16 years 4 months ago
Injecting utility into anonymized datasets
Limiting disclosure in data publishing requires a careful balance between privacy and utility. Information about individuals must not be revealed, but a dataset should still be us...
Daniel Kifer, Johannes Gehrke
SIGMOD
2004
ACM
112views Database» more  SIGMOD 2004»
16 years 4 months ago
Matching Large XML Schemas
Current schema matching approaches still have to improve for very large and complex schemas. Such schemas are increasingly written in the standard language W3C XML schema, especia...
Erhard Rahm, Hong Hai Do, Sabine Massmann