Sciweavers

5055 search results - page 42 / 1011
» Relative Timing
Sort
View
VLDB
1999
ACM
112views Database» more  VLDB 1999»
15 years 2 months ago
Context-Based Prefetch for Implementing Objects on Relations
When implementing persistent objects on a relational database, a major performance issue is prefetching data to minimize the number of roundtrips to the database. This is especial...
Philip A. Bernstein, Shankar Pal, David Shutt
FLAIRS
2004
14 years 11 months ago
A Theory for Convex Interval Relations including Unbounded Intervals
We extend the basic axiomatization of interval convex relations by Allen and Hayes with unbounded intervals. Unbounded intervals include since intervals with a finite beginning po...
Diana Cukierman, James P. Delgrande
GVD
2001
142views Database» more  GVD 2001»
14 years 11 months ago
An approach to the model-based fragmentation and relational storage of XML-documents
A flexible method to store XML documents in relational or object-relational databases is presented that is based on an adaptable fragmentation. Whereas most known approaches decom...
Christian Süß
JMLR
2006
143views more  JMLR 2006»
14 years 9 months ago
Consistency and Convergence Rates of One-Class SVMs and Related Algorithms
We determine the asymptotic behaviour of the function computed by support vector machines (SVM) and related algorithms that minimize a regularized empirical convex loss function i...
Régis Vert, Jean-Philippe Vert
KSEM
2010
Springer
14 years 8 months ago
Discovery of Relation Axioms from the Web
Given the proven usefulness of ontologies in many areas, the representation of logical axioms associated to ontological concepts and relations has become an important task in order...
Luis Del Vasto Terrientes, Antonio Moreno, David S...