Sciweavers

1805 search results - page 322 / 361
» A Theory of Closure Operators
Sort
View
PPDP
2010
Springer
15 years 1 months ago
Rewrite-based verification of XML updates
We propose a model for XML update primitives of the W3C XQuery Update Facility as parameterized rewriting rules of the form: "insert an unranked tree from a regular tree lang...
Florent Jacquemard, Michaël Rusinowitch
SODA
2012
ACM
170views Algorithms» more  SODA 2012»
13 years 6 months ago
Compression via matroids: a randomized polynomial kernel for odd cycle transversal
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...
Stefan Kratsch, Magnus Wahlström
WWW
2007
ACM
16 years 4 months ago
Speeding up adaptation of web service compositions using expiration times
Web processes must often operate in volatile environments where the quality of service parameters of the participating service providers change during the life time of the process...
John Harney, Prashant Doshi
WWW
2006
ACM
16 years 4 months ago
Compressing and searching XML data via two zips
XML is fast becoming the standard format to store, exchange and publish over the web, and is getting embedded in applications. Two challenges in handling XML are its size (the XML...
Paolo Ferragina, Fabrizio Luccio, Giovanni Manzini...
WWW
2003
ACM
16 years 4 months ago
The chatty web: emergent semantics through gossiping
This paper describes a novel approach for obtaining semantic interoperability among data sources in a bottom-up, semiautomatic manner without relying on pre-existing, global seman...
Karl Aberer, Manfred Hauswirth, Philippe Cudr&eacu...