Sciweavers

644 search results - page 63 / 129
» Real Algebraic Numbers: Complexity Analysis and Experimentat...
Sort
View
ISBI
2004
IEEE
14 years 9 months ago
Probabilistic ICA for fMRI
Independent Component Analysis is becoming a popular exploratory method for analysing complex data such as that from FMRI experiments. The application of such `model-free' me...
Christian Beckmann
SIGMOD
2011
ACM
206views Database» more  SIGMOD 2011»
12 years 11 months ago
Sampling based algorithms for quantile computation in sensor networks
We study the problem of computing approximate quantiles in large-scale sensor networks communication-efficiently, a problem previously studied by Greenwald and Khana [12] and Shri...
Zengfeng Huang, Lu Wang, Ke Yi, Yunhao Liu
ICIP
2005
IEEE
14 years 10 months ago
Visual tracking via efficient kernel discriminant subspace learning
Robustly tracking moving objects in video sequences is one of the key problems in computer vision. In this paper we introduce a computationally efficient nonlinear kernel learning...
Chunhua Shen, Anton van den Hengel, Michael J. Bro...
KDD
2009
ACM
204views Data Mining» more  KDD 2009»
14 years 9 months ago
DOULION: counting triangles in massive graphs with a coin
Counting the number of triangles in a graph is a beautiful algorithmic problem which has gained importance over the last years due to its significant role in complex network analy...
Charalampos E. Tsourakakis, U. Kang, Gary L. Mille...
MMB
2010
Springer
194views Communications» more  MMB 2010»
14 years 1 months ago
Searching for Tight Performance Bounds in Feed-Forward Networks
Abstract. Computing tight performance bounds in feed-forward networks under general assumptions about arrival and server models has turned out to be a challenging problem. Recently...
Andreas Kiefer, Nicos Gollan, Jens B. Schmitt