Sciweavers

16257 search results - page 342 / 3252
» D-finiteness: algorithms and applications
Sort
View
SIAMCOMP
2010
172views more  SIAMCOMP 2010»
15 years 1 months ago
Deterministic Polynomial Time Algorithms for Matrix Completion Problems
We present new deterministic algorithms for several cases of the maximum rank matrix completion problem (for short matrix completion), i.e. the problem of assigning values to the ...
Gábor Ivanyos, Marek Karpinski, Nitin Saxen...
ICASSP
2011
IEEE
14 years 10 months ago
An unsupervised algorithm for hybrid/morphological signal decomposition
The main contribution presented here is an adaptive/unsupervised iterative thresholding algorithm for sparse representation of signals which can be modeled as the sum of two compo...
Matthieu Kowalski, Thomas Rodet
KDD
2005
ACM
142views Data Mining» more  KDD 2005»
16 years 7 months ago
Towards exploratory test instance specific algorithms for high dimensional classification
In an interactive classification application, a user may find it more valuable to develop a diagnostic decision support method which can reveal significant classification behavior...
Charu C. Aggarwal
VLDB
2005
ACM
153views Database» more  VLDB 2005»
16 years 7 months ago
An effective and efficient algorithm for high-dimensional outlier detection
Abstract. The outlier detection problem has important applications in the field of fraud detection, network robustness analysis, and intrusion detection. Most such applications are...
Charu C. Aggarwal, Philip S. Yu
ISPDC
2008
IEEE
16 years 1 months ago
Algorithms for Network Topology Discovery using End-to-End Measurements
Identifying and inferring performances of a network topology is a well known problem. Achieving this by using only end-to-end measurements at the application level is a method kno...
Laurent Bobelin, Traian Muntean