Sciweavers

2020 search results - page 220 / 404
» Speeding up Slicing
Sort
View
ICFP
2003
ACM
14 years 10 months ago
Optimistic evaluation: an adaptive evaluation strategy for non-strict programs
Lazy programs are beautiful, but they are slow because they build many thunks. Simple measurements show that most of these thunks are unnecessary: they are in fact always evaluate...
Robert Ennals, Simon L. Peyton Jones
PERCOM
2008
ACM
14 years 10 months ago
IP Address Passing for VANETs
In Vehicular Ad-hoc Networks (VANETs), vehicles can gain short connections to the Internet by using wireless access points (AP). A significant part of the connection time is the t...
Todd Arnold, Wyatt Lloyd, Jing Zhao, Guohong Cao
DCC
2007
IEEE
14 years 10 months ago
Nonuniform Compression in Databases with Haar Wavelet
Data synopsis is a lossy compressed representation of data stored into databases that helps the query optimizer to speed up the query process, e.g. time to retrieve the data from ...
S. Chen, A. Nucci
SDM
2009
SIAM
176views Data Mining» more  SDM 2009»
14 years 7 months ago
Constraint-Based Subspace Clustering.
In high dimensional data, the general performance of traditional clustering algorithms decreases. This is partly because the similarity criterion used by these algorithms becomes ...
Élisa Fromont, Adriana Prado, Céline...
ALT
2003
Springer
14 years 7 months ago
Kernel Trick Embedded Gaussian Mixture Model
In this paper, we present a kernel trick embedded Gaussian Mixture Model (GMM), called kernel GMM. The basic idea is to embed kernel trick into EM algorithm and deduce a parameter ...
Jingdong Wang, Jianguo Lee, Changshui Zhang