Sciweavers

341 search results - page 57 / 69
» Redundancy elimination revisited
Sort
View
ESWS
2009
Springer
13 years 5 months ago
Applied Temporal RDF: Efficient Temporal Querying of RDF Data with SPARQL
Many applications operate on time-sensitive data. Some of these data are only valid for certain intervals (e.g., job-assignments, versions of software code), others describe tempor...
Jonas Tappolet, Abraham Bernstein
CORR
2010
Springer
126views Education» more  CORR 2010»
13 years 2 months ago
Reed Muller Sensing Matrices and the LASSO
We construct two families of deterministic sensing matrices where the columns are obtained by exponentiating codewords in the quaternary Delsarte-Goethals code DG(m, r). This meth...
A. Robert Calderbank, Sina Jafarpour
JAIR
2011
138views more  JAIR 2011»
13 years 2 months ago
Identifying Aspects for Web-Search Queries
Many web-search queries serve as the beginning of an exploration of an unknown space of information, rather than looking for a specific web page. To answer such queries effectiv...
Fei Wu, Jayant Madhavan, Alon Y. Halevy
JCS
2010
80views more  JCS 2010»
13 years 2 months ago
Constraint differentiation: Search-space reduction for the constraint-based analysis of security protocols
We introduce constraint differentiation, a powerful technique for reducing search when model-checking security protocols using constraint-based methods. Constraint differentiation...
Sebastian Mödersheim, Luca Viganò, Dav...
WWW
2007
ACM
14 years 8 months ago
XML design for relational storage
Design principles for XML schemas that eliminate redundancies and avoid update anomalies have been studied recently. Several normal forms, generalizing those for relational databa...
Solmaz Kolahi, Leonid Libkin