Sciweavers

490 search results - page 21 / 98
» Modeling lobed leaves
Sort
View
ICDE
2012
IEEE
269views Database» more  ICDE 2012»
11 years 11 months ago
A Deep Embedding of Queries into Ruby
—We demonstrate SWITCH, a deep embedding of relational queries into RUBY and RUBY on RAILS. With SWITCH, there is no syntactic or stylistic difference between RUBY programs that ...
Torsten Grust, Manuel Mayr
ICML
2004
IEEE
14 years 9 months ago
Improving SVM accuracy by training on auxiliary data sources
The standard model of supervised learning assumes that training and test data are drawn from the same underlying distribution. This paper explores an application in which a second...
Pengcheng Wu, Thomas G. Dietterich
WWW
2001
ACM
14 years 9 months ago
Batch rekeying for secure group communications
Many emerging web and Internet applications are based on a group communications model. Thus, securing group communications is an important Internet design issue. The key graph app...
Xiaozhou (Steve) Li, Yang Richard Yang, Mohamed G....
KDD
2003
ACM
243views Data Mining» more  KDD 2003»
14 years 9 months ago
Accurate decision trees for mining high-speed data streams
In this paper we study the problem of constructing accurate decision tree models from data streams. Data streams are incremental tasks that require incremental, online, and any-ti...
João Gama, Pedro Medas, Ricardo Rocha
ISAAC
2009
Springer
132views Algorithms» more  ISAAC 2009»
14 years 3 months ago
Online Sorted Range Reporting
Abstract. We study the following one-dimensional range reporting problem: On an array A of n elements, support queries that given two indices i ≤ j and an integer k report the k ...
Gerth Stølting Brodal, Rolf Fagerberg, Mark...