Sciweavers

1495 search results - page 239 / 299
» Volumetric Data Analysis using Morse-Smale Complexes
Sort
View
WWW
2004
ACM
16 years 6 months ago
Visual web mining
Analysis of web site usage data involves two significant challenges: firstly the volume of data, arising from the growth of the web, and secondly, the structural complexity of web...
Amir H. Youssefi, David J. Duke, Mohammed Javeed Z...
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
16 years 6 months ago
Lower bounds for dynamic connectivity
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
Mihai Patrascu, Erik D. Demaine
ICML
2008
IEEE
16 years 6 months ago
Expectation-maximization for sparse and non-negative PCA
We study the problem of finding the dominant eigenvector of the sample covariance matrix, under additional constraints on the vector: a cardinality constraint limits the number of...
Christian D. Sigg, Joachim M. Buhmann
ICML
2006
IEEE
16 years 6 months ago
Iterative RELIEF for feature weighting
RELIEF is considered one of the most successful algorithms for assessing the quality of features. In this paper, we propose a set of new feature weighting algorithms that perform s...
Yijun Sun, Jian Li
POPL
2003
ACM
16 years 6 months ago
Selective memoization
We present a framework for applying memoization selectively. The framework provides programmer control over equality, space usage, and identification of precise dependences so tha...
Umut A. Acar, Guy E. Blelloch, Robert Harper