Sciweavers

502 search results - page 46 / 101
» Sparse Subspace Clustering
Sort
View
SC
2009
ACM
15 years 6 months ago
GPU based sparse grid technique for solving multidimensional options pricing PDEs
It has been shown that the sparse grid combination technique can be a practical tool to solve high dimensional PDEs arising in multidimensional option pricing problems in finance...
Abhijeet Gaikwad, Ioane Muni Toke
ALT
2008
Springer
15 years 11 months ago
Generalization Bounds for K-Dimensional Coding Schemes in Hilbert Spaces
We give a bound on the expected reconstruction error for a general coding method where data in a Hilbert space are represented by finite dimensional coding vectors. The result can...
Andreas Maurer, Massimiliano Pontil
TKDE
2012
250views Formal Methods» more  TKDE 2012»
13 years 4 months ago
Dense Subgraph Extraction with Application to Community Detection
— This paper presents a method for identifying a set of dense subgraphs of a given sparse graph. Within the main applications of this “dense subgraph problem”, the dense subg...
Jie Chen 0007, Yousef Saad
MM
2006
ACM
221views Multimedia» more  MM 2006»
15 years 8 months ago
Video object segmentation by motion-based sequential feature clustering
Segmentation of video foreground objects from background has many important applications, such as human computer interaction, video compression, multimedia content editing and man...
Mei Han, Wei Xu, Yihong Gong
ECIR
2006
Springer
15 years 3 months ago
Phrase Clustering Without Document Context
Abstract. We applied different clustering algorithms to the task of clustering multi-word terms in order to reflect a humanly built ontology. Clustering was done without the usual ...
Eric SanJuan, Fidelia Ibekwe-Sanjuan