Sciweavers

191 search results - page 13 / 39
» Extending the Relational Algebra to Support Transaction Time
Sort
View
ICML
2004
IEEE
15 years 10 months ago
A hierarchical method for multi-class support vector machines
We introduce a framework, which we call Divide-by-2 (DB2), for extending support vector machines (SVM) to multi-class problems. DB2 offers an alternative to the standard one-again...
Volkan Vural, Jennifer G. Dy
ICDE
2007
IEEE
117views Database» more  ICDE 2007»
15 years 11 months ago
Unnesting Scalar SQL Queries in the Presence of Disjunction
Optimizing nested queries is an intricate problem. It becomes even harder if in a nested query the linking predicate or the correlation predicate occurs disjunctively. We present ...
Matthias Brantner, Norman May, Guido Moerkotte
64
Voted
CIKM
2005
Springer
15 years 3 months ago
Indexing time vs. query time: trade-offs in dynamic information retrieval systems
We examine issues in the design of fully dynamic information retrieval systems with support for instantaneous document insertions and deletions. We present one such system and dis...
Stefan Büttcher, Charles L. A. Clarke
CORR
2008
Springer
116views Education» more  CORR 2008»
14 years 9 months ago
An Evidential Path Logic for Multi-Relational Networks
Multi-relational networks are used extensively to structure knowledge. Perhaps the most popular instance, due to the widespread adoption of the Semantic Web, is the Resource Descr...
Marko A. Rodriguez, Joe Geldart
DMKD
1997
ACM
198views Data Mining» more  DMKD 1997»
15 years 1 months ago
Clustering Based On Association Rule Hypergraphs
Clustering in data mining is a discovery process that groups a set of data such that the intracluster similarity is maximized and the intercluster similarity is minimized. These d...
Eui-Hong Han, George Karypis, Vipin Kumar, Bamshad...