Sciweavers

265 search results - page 21 / 53
» On the Intersection of XPath Expressions
Sort
View
WEBDB
2004
Springer
125views Database» more  WEBDB 2004»
14 years 1 months ago
Best-Match Querying from Document-Centric XML
On the Web, there is a pervasive use of XML to give lightweight semantics to textual collections. Such documentcentric XML collections require a query language that can gracefully...
Jaap Kamps, Maarten Marx, Maarten de Rijke, Bö...
CSL
2009
Springer
13 years 12 months ago
Intersection, Universally Quantified, and Reference Types
The aim of this paper is to understand the interplay between intersection, universally quantified, and reference types. Putting together the standard typing rules for intersection,...
Mariangiola Dezani-Ciancaglini, Paola Giannini, Si...
ML
2007
ACM
108views Machine Learning» more  ML 2007»
13 years 8 months ago
Unconditional lower bounds for learning intersections of halfspaces
We prove new lower bounds for learning intersections of halfspaces, one of the most important concept classes in computational learning theory. Our main result is that any statist...
Adam R. Klivans, Alexander A. Sherstov
EDBT
2011
ACM
199views Database» more  EDBT 2011»
12 years 12 months ago
Finding closed frequent item sets by intersecting transactions
Most known frequent item set mining algorithms work by enumerating candidate item sets and pruning infrequent candidates. An alternative method, which works by intersecting transa...
Christian Borgelt, Xiaoyuan Yang, Rubén Nog...
DLT
2009
13 years 6 months ago
Tight Bounds on the Descriptional Complexity of Regular Expressions
Abstract. We improve on some recent results on lower bounds for conversion problems for regular expressions. In particular we consider the conversion of planar deterministic finite...
Hermann Gruber, Markus Holzer