Sciweavers

2774 search results - page 316 / 555
» Exploiting Deep Structure
Sort
View
ICASSP
2011
IEEE
14 years 10 months ago
Polytope kernel density estimates on Delaunay graphs
We present a polytope-kernel density estimation (PKDE) methodology that allows us to perform exact mean-shift updates along the edges of the Delaunay graph of the data. We discuss...
Erhan Bas, Deniz Erdogmus
ICASSP
2011
IEEE
14 years 10 months ago
Using latent topic features to improve binary classification of spoken documents
In many topic identification applications, supervised training labels are indirectly related to the semantic content of the documents being classified. For example, many topical...
Jonathan Wintrode
DEXAW
2009
IEEE
173views Database» more  DEXAW 2009»
16 years 1 months ago
Automatic Cluster Number Selection Using a Split and Merge K-Means Approach
Abstract—The k-means method is a simple and fast clustering technique that exhibits the problem of specifying the optimal number of clusters preliminarily. We address the problem...
Markus Muhr, Michael Granitzer
CC
2012
Springer
271views System Software» more  CC 2012»
14 years 2 months ago
Parallel Replication-Based Points-To Analysis
Pointer analysis is one of the most important static analyses during compilation. While several enhancements have been made to scale pointer analysis, the work on parallelizing the...
Sandeep Putta, Rupesh Nasre
CORR
2012
Springer
209views Education» more  CORR 2012»
14 years 2 months ago
Aggregation in Probabilistic Databases via Knowledge Compilation
This paper presents a query evaluation technique for positive relational algebra queries with aggregates on a representation system for probabilistic data based on the algebraic s...
Robert Fink, Larisa Han, Dan Olteanu